A pattern-first approach to DSA. Instead of grinding random problems, this roadmap groups topics by pattern — so when you see a new problem you know which mental model to reach for first.
Arrays, strings, linked lists, stacks, and queues.
Two pointers, prefix sums, and the string problems that come up in every loop of interviews.
Search space reduction, the off-by-one that breaks every first implementation, and rotated array variants.
Fast/slow pointers, reversal in-place, cycle detection (Floyd's algorithm), and merge problems.
The problems that separate juniors from senior candidates.
DFS (pre/in/post), BFS level-order, lowest common ancestor, and serialisation.
BFS, DFS, topological sort, and connected components — with adjacency list vs matrix trade-offs.
Identifying overlapping subproblems, memoisation vs tabulation, and the 10 patterns that cover most DP problems.
Architecture concepts that get tested at FAANG and new-grad interviews alike.
Delta sync, conflict resolution strategies, and the outbox pattern — with a real implementation as example.
End of roadmap
You've covered all 7 topics in the DSA roadmap.