DSA Warm-up

Overview

This checklist focuses on warming up your Data Structures and Algorithms problem-solving skills. Spend time analyzing algorithmic complexity, implementing core sorting logic by hand, and solving standard array/string patterns.

Target: Solve a minimum of 25 problems (Easy to Medium difficulty) spanning Two-Pointer, Sliding Window, Prefix Sum, Kadane's, and Binary Search.

Complexity Analysis

• Big O — O(1), O(log n), O(n), O(n log n), O(n²), O(2ⁿ)
• Space complexity
• Analyze loops, nested loops, recursion

Arrays & Strings (Revise + Practice)

• Two-pointer technique
• Sliding window
• Prefix sum
• Kadane's algorithm
• Binary search & variations
• Practice: 25 problems (Easy/Medium mix)

Sorting Refresh

• Merge sort, Quick sort — know the code
• Counting sort, Radix sort (concept)
• Know when to use which