Paths / Data structures & algorithms
Learning path · DSA
Data structures & algorithms.
A staircase you climb one problem at a time. Each step rises by the new pages a problem needs, usually just one, and its tread is the problem itself. Mostly flat, so you spend your time solving.
climbStairs(path) · 35 steps, 44 pages, 0 readread / solvednextaheadselected step
1 / 35
Rise · 4 new pages
Tread · problem 1 · easy
Two Sum
Find two numbers that add up to a target, in one pass.
4 to read first. Planned: this problem opens here when it's built, and isn't counted yet.
Every step
The same path as a list. Choose a row to select its step.
| # | Problem | New pages | Status |
|---|---|---|---|
| 1 | +4 · Big-O notation & analysis, Arrays & strings, Space & amortized analysis, Hash tables & maps | 4 to read | |
| 2 | +1 · Stacks & queues | 1 to read | |
| 3 | +1 · Linked lists | 1 to read | |
| 4 | +1 · Two pointers | 1 to read | |
| 5 | +1 · Sliding window | 1 to read | |
| 6 | +1 · Prefix sums | 1 to read | |
| 7 | +1 · Fast & slow pointers | 1 to read | |
| 8 | +1 · Linear & binary search | 1 to read | |
| 9 | +3 · Basic sorting, Recursion & backtracking, Merge sort & quicksort | 3 to read | |
| 10 | +1 · Merge intervals | 1 to read | |
| 11 | +1 · Monotonic stack & queue | 1 to read | |
| 12 | +0 | pages read | |
| 13 | +2 · Heaps & priority queues, Top-K & k-way merge | 2 to read | |
| 14 | +2 · Binary trees & BSTs, Tree traversals | 2 to read | |
| 15 | +1 · Tries | 1 to read | |
| 16 | +3 · Graphs & representations, BFS & DFS, Grid traversal | 3 to read | |
| 17 | +1 · Topological sort | 1 to read | |
| 18 | +1 · Union-find | 1 to read | |
| 19 | +1 · Dijkstra's algorithm | 1 to read | |
| 20 | +1 · Bellman-Ford & Floyd-Warshall | 1 to read | |
| 21 | +1 · Minimum spanning trees | 1 to read | |
| 22 | +2 · Divide & conquer, Dynamic programming: basics | 2 to read | |
| 23 | +1 · Dynamic programming: classic families | 1 to read | |
| 24 | +1 · Greedy algorithms | 1 to read | |
| 25 | +0 | pages read | |
| 26 | +1 · Binary search on the answer | 1 to read | |
| 27 | +1 · Bit manipulation | 1 to read | |
| 28 | +1 · String algorithms: KMP & rolling hash | 1 to read | |
| 29 | +1 · Math basics: GCD, primes & modular arithmetic | 1 to read | |
| 30 | +1 · Lowest common ancestor | 1 to read | |
| 31 | +1 · Segment & Fenwick trees | 1 to read | |
| 32 | +1 · Balanced trees | 1 to read | |
| 33 | +1 · Linear-time sorting | 1 to read | |
| 34 | +2 · Maximum flow, Minimum cut | 2 to read | |
| 35 | +1 · Bipartite matching | 1 to read |