Groups
Category
Coordinate compression replaces large, sparse, or arbitrary values with small consecutive integers while preserving relative order.
A Fenwick Tree (Binary Indexed Tree) maintains prefix sums so you can update a single position and query a prefix in O(\log n) time with a tiny constant factor.