Range Queries & Advanced Structures
Union-find, Fenwick and segment trees, sparse tables and LCA, and randomized structures.
0 / 8 solved
-
Union-Find (Disjoint Set Union)
Union by size or rank, path compression, the inverse Ackermann bound, DSU with extra data, and what DSU cannot do.
-
Fenwick Trees & Prefix Aggregates
Prefix sums with log n updates, lowbit arithmetic, range updates, and binary lifting on the tree.
-
Segment Trees & Lazy Propagation
Range decomposition, merge functions and identities, lazy propagation, and iterative and dynamic variants.
-
Sparse Tables, RMQ & LCA
Sparse tables with O(1) queries, binary lifting, LCA by Euler tour, and sparse table vs segment tree.
-
Randomized Structures: Skip Lists, Treaps & Bloom Filters
Skip lists, treaps, and Bloom filters.
Up next
8 of 8 questions here are still unsolved.