Loading
Tries, union-find, segment trees, and Fenwick trees — the structures that turn O(n) queries into O(log n).
Chapters unlock with the track. Complete Trees and Graphs first.
This build ships a representative sample of the catalogue rather than every problem in it.