Groups
Category
Level
0-1 BFS is a shortest path algorithm specialized for graphs whose edge weights are only 0 or 1.
Prefix sums precompute running totals so any range sum [l, r] can be answered in O(1) time as prefix[r] - prefix[l-1].
Sorting arranges items into a chosen order so that searching, grouping, and further algorithms become faster and simpler.
Centroid decomposition splits a tree into levels by repeatedly removing a centroid so that each remaining component is at most half the size.