Algorithm Learning Paths
Focused routes through every translated learning page in the catalog
Each route is intentionally small. Work through the pages in order, use the player controls instead of passively watching, and check the complexity reference whenever two approaches feel similar.
Foundations 21 stops
Build a feel for logarithmic elimination, partitioning, and compact cumulative data.
- 1Array->
- 2Linked List->
- 3Stack->
- 4Queue and Deque->
- 5Binary Search Tree->
- 6Binary Heap->
- 7Hash Table->
- 8Graph->
- 9Trie->
- 10Disjoint Set Union->
- 11LRU Cache->
- 12Skip List->
- 13Segment Tree->
- 14B+ Tree->
- 15Bloom Filter->
- 16Fenwick Tree->
- 17Binary Search->
- 18Lower and Upper Bound->
- 19Search in a Rotated Sorted Array->
- 20Binary Search on the Answer->
- 21Ternary Search
Sorting Systems 16 stops
Compare how different invariants move values into their final order.
Graph Structure 12 stops
Build paths and global structure by processing vertices and edges safely.
Dynamic Programming 11 stops
Define states, preserve dependencies, and reuse solved subproblems.
Backtracking 9 stops
Choose, validate, recurse, and undo while exploring a constrained search space.
String Structure 8 stops
Preprocess reusable structure so comparisons can skip repeated work.
Number Theory 10 stops
Follow divisibility invariants through prime generation and greatest divisors.
Geometry 5 stops
Use orientation and distance invariants to reason about point sets.