Home
resolved 0/15

End-to-end DSA roadmap · dependency-ordered

Your interview prep, topologically sorted.

Fifteen topics wired as a dependency graph — exactly the way the subject actually works. A node unlocks only when everything it requires is resolved. Click any node to push its stack frame: the patterns to learn, the exact LeetCode set, and the resources that teach them. Finish a topic, mark it resolved, and the graph opens the next frame.

// one valid execution order (Kahn's algorithm, computed live)

next uplocked — resolve deps firstresolvedclick node = push frame · follow a dep chip = push another frame · esc = pop all
Arrays & Strings13 problems · wk 1–2○▶Hashing & Prefix Sum8 problems · wk 2🔒Two Pointers8 problems · wk 2–3🔒Recursion & Backtracking13 problems · wk 3–4🔒Stack9 problems · wk 3🔒Sliding Window7 problems · wk 3–4🔒Binary Search8 problems · wk 4🔒Linked List11 problems · wk 4–5🔒Monotonic Stack8 problems · wk 5🔒Queue & Deque8 problems · wk 5🔒Binary Trees & BST15 problems · wk 5–7🔒DFS9 problems · wk 7🔒BFS10 problems · wk 7–8🔒Dynamic Programming15 problems · wk 8–12🔒Graphs12 problems · wk 8–10🔒
PAIRS WITHHow I Cracked 50+ DSA Interviews and Landed at Uber
The strategy behind this roadmap — the BFS preparation method, the 30-minute rule, and the full resource stack.
read →
built by engineers who sit on hiring committeesbook a 1:1 mock interview →progress saves locally in your browser