Roadmaps
Follow ordered paths instead of random problem lists.
Dynamic Programming Roadmap
From 1D DP to grids, knapsacks, and LIS — a structured DP interview path.
3 stages
Graph Algorithms Roadmap
BFS, DFS, Union-Find, topological sort, and shortest paths for interviews.
3 stages
Binary Search Roadmap
Classic search, rotated arrays, and answer-space binary search.
2 stages
DSA Fundamentals Roadmap
A beginner-to-job path: arrays → hashing → trees → graphs → DP.
4 stages