All roadmaps

DSA Mastery — 12 Weeks

Master all major DSA topics from arrays to graphs and dynamic programming.

Progress
0% (0/126)

Week 1: Arrays & Strings

0/14 done
  • Two Pointer technique2h
  • Sliding Window pattern2h
  • Prefix Sum arrays1h
  • Kadane's algorithm (max subarray)1h
  • Dutch National Flag (sort 0s,1s,2s)1h
  • Array rotation techniques1h
  • String manipulation basics1.5h
  • Anagram detection45m
  • Palindrome check variants45m
  • Longest common prefix1h
  • String compression1h
  • Minimum window substring2h
  • Valid parentheses45m
  • Trapping rain water1.5h

Week 2: Searching & Sorting

0/10 done
  • Binary search (standard)1h
  • Binary search on answer2h
  • Search in rotated sorted array1.5h
  • Find first/last occurrence1h
  • Bubble/Selection/Insertion sort1h
  • Merge sort (divide & conquer)2h
  • Quick sort and partition2h
  • Counting sort (for bounded input)1h
  • K-th largest element1.5h
  • Meeting rooms / interval merge2h

Week 3: Linked Lists

0/12 done
  • Singly LL: insert, delete, traverse1.5h
  • Reverse a linked list45m
  • Detect cycle (Floyd's algorithm)1.5h
  • Find cycle start1.5h
  • Merge two sorted lists1h
  • Merge K sorted lists2h
  • Find middle of linked list30m
  • Remove Nth node from end1h
  • Intersection of two lists1h
  • Palindrome linked list1.5h
  • Copy list with random pointer2h
  • Flatten a multilevel LL2h

Week 4: Stacks & Queues

0/10 done
  • Stack: push/pop/peek, min-stack1h
  • Queue using two stacks1h
  • Valid parentheses (extended)30m
  • Daily temperatures (monotonic stack)1.5h
  • Largest rectangle in histogram2h
  • Sliding window maximum2h
  • Implement LRU Cache2.5h
  • Next greater element1.5h
  • Evaluate reverse Polish notation1h
  • Decode string1.5h

Week 5: Trees Part 1

0/12 done
  • Binary tree traversals (in/pre/post)1.5h
  • Level order traversal (BFS)1.5h
  • Height of binary tree30m
  • Diameter of binary tree1.5h
  • Lowest Common Ancestor1.5h
  • Path sum problems2h
  • Symmetric tree check1h
  • Invert binary tree30m
  • Binary tree to DLL2h
  • Serialize and deserialize BT2.5h
  • Zigzag level order1.5h
  • Right side view1.5h

Week 6: Trees Part 2 — BST & Heaps

0/10 done
  • BST: insert, delete, search1.5h
  • Validate BST1.5h
  • Kth smallest in BST1h
  • BST to sorted array & back1.5h
  • Min/Max heap operations1.5h
  • K largest elements using heap1.5h
  • Merge K sorted arrays2h
  • Top K frequent elements1.5h
  • Find median from data stream2.5h
  • Heap sort1.5h

Week 7: Graphs

0/14 done
  • Graph representation (adj list/matrix)1h
  • BFS traversal1.5h
  • DFS traversal1.5h
  • Number of islands1.5h
  • Connected components1h
  • Detect cycle (directed + undirected)2h
  • Topological sort (DFS + Kahn's)2h
  • Shortest path: BFS unweighted1.5h
  • Dijkstra's algorithm2.5h
  • Bellman-Ford2h
  • Floyd-Warshall2h
  • MST (Kruskal/Prim)2.5h
  • Union-Find (DSU)2h
  • Course schedule (topology)1.5h

Week 8: Dynamic Programming Part 1

0/12 done
  • Fibonacci (memo + tabulation)1.5h
  • Climbing stairs30m
  • House robber1h
  • Jump game1.5h
  • Coin change1.5h
  • Longest increasing subsequence2h
  • 0/1 Knapsack2h
  • Subset sum2h
  • Partition equal subset sum2h
  • Target sum1.5h
  • Minimum path sum in grid1.5h
  • Unique paths1h

Week 9: DP Part 2

0/10 done
  • Longest common subsequence2h
  • Longest common substring1.5h
  • Edit distance2h
  • Matrix chain multiplication2.5h
  • Palindromic substrings2h
  • Burst balloons2.5h
  • Word break2h
  • Decode ways1.5h
  • Best time to buy/sell stock variants2h
  • Wildcard matching2.5h

Week 10: Hashing & Advanced

0/8 done
  • Two sum with HashMap30m
  • Subarray sum equals K1.5h
  • Longest subarray with sum K1.5h
  • Group anagrams1h
  • 4Sum / kSum pattern2h
  • Count distinct elements in window2h
  • Trie: insert, search, startsWith2h
  • Implement Trie for word search2h

Week 11: Backtracking

0/8 done
  • Subsets / Power set1.5h
  • Permutations1.5h
  • Combinations1.5h
  • N-Queens2h
  • Sudoku solver2.5h
  • Word search in grid2h
  • Combination sum1.5h
  • Letter combinations of phone number1h

Week 12: Mock Interviews & Revision

0/6 done
  • Full mock: Array + String problems3h
  • Full mock: Trees + Graphs3h
  • Full mock: DP patterns3h
  • Company-specific OA simulation2h
  • Complexity analysis review1.5h
  • Final revision: weak areas3h