📘 DSA Problem-Solving Roadmap
Phase 1: Arrays & Strings & Linked List
1. Two Sum – LeetCode 1
2. Best Time to Buy and Sell Stock – LeetCode 121
3. Maximum Subarray (Kadane’s) – LeetCode 53
4. Rotate Array – LeetCode 189
5. Merge Intervals – LeetCode 56
6. Valid Palindrome – LeetCode 125
7. Longest Substring Without Repeating Characters – LeetCode 3
8. Reverse String – LeetCode 344
9. Reverse Linked List – LeetCode 206
10. Merge Two Sorted Lists – LeetCode 21
Phase 2: Stack, Queue, Deque
1. Valid Parentheses – LeetCode 20
2. Min Stack – LeetCode 155
3. Implement Queue using Stacks – LeetCode 232
4. Next Greater Element I – LeetCode 496
5. Daily Temperatures – LeetCode 739
6. Sliding Window Maximum – LeetCode 239
7. Design Circular Queue – LeetCode 622
8. Implement Stack using Queues – LeetCode 225
9. Simplify Path – LeetCode 71
10. Decode String – LeetCode 394
Phase 3: Hashing & Sets
1. Contains Duplicate – LeetCode 217
2. Valid Anagram – LeetCode 242
3. Group Anagrams – LeetCode 49
4. Subarray Sum Equals K – LeetCode 560
5. Longest Substring Without Repeating Characters – LeetCode 3
6. Two Sum (HashMap) – LeetCode 1
7. Intersection of Two Arrays – LeetCode 349
8. Happy Number – LeetCode 202
9. Top K Frequent Elements – LeetCode 347
10. Longest Consecutive Sequence – LeetCode 128
Phase 4: Trees (Binary Tree + BST + Heap)
1. Maximum Depth of Binary Tree – LeetCode 104
2. Symmetric Tree – LeetCode 101
3. Binary Tree Level Order Traversal – LeetCode 102
4. Lowest Common Ancestor of BST – LeetCode 235
5. Validate Binary Search Tree – LeetCode 98
6. Convert Sorted Array to BST – LeetCode 108
7. Diameter of Binary Tree – LeetCode 543
8. Serialize and Deserialize Binary Tree – LeetCode 297
9. Merge Two Binary Trees – LeetCode 617
10. Kth Largest Element in Array (Heap) – LeetCode 215
Phase 5: Advanced Trees (Trie, Segment Tree, BIT)
1. Implement Trie (Prefix Tree) – LeetCode 208
2. Word Search II – LeetCode 212
3. Maximum XOR of Two Numbers in Array – LeetCode 421
4. Add and Search Word – LeetCode 211
5. Design Add and Search Dictionary – LeetCode 211
6. Range Sum Query – Immutable – LeetCode 303
7. Range Sum Query – Mutable (Segment Tree) – LeetCode 307
8. Fenwick Tree Practice – GFG (Range Sum Queries)
9. Count of Smaller Numbers After Self – LeetCode 315
10. Longest Word in Dictionary – LeetCode 720
Phase 6: Graphs
1. Number of Islands – LeetCode 200
2. Clone Graph – LeetCode 133
3. Course Schedule – LeetCode 207
4. Course Schedule II – LeetCode 210
5. Graph Valid Tree – LeetCode 261
6. Word Ladder – LeetCode 127
7. Pacific Atlantic Water Flow – LeetCode 417
8. Redundant Connection – LeetCode 684
9. Minimum Spanning Tree (Kruskal/Prim) – GFG
10. Dijkstra’s Algorithm – GFG
Phase 7: Specialized DS (Optional / Advanced CP)
1. LRU Cache – LeetCode 146
2. Design Twitter – LeetCode 355
3. Skip List – LeetCode 1206
4. Randomized Set – LeetCode 380
5. All O(1) Data Structure – LeetCode 432
6. Design HashMap – LeetCode 706
7. Design HashSet – LeetCode 705
8. Suffix Array Practice – GFG
9. Bloom Filter Concept – Practice (Implementation)
10. Quad Tree (Construction) – LeetCode 427
