Choose an index by its accepted operations, then check endpoints, mutation rules, and cost. Each question refers to the specific implementation linked below.
Lessons
- Square-root blocks: update one capacity and sum a range
- Merge-sort trees: count readings below a threshold in one interval
- Disjoint sparse tables: immutable sums with constant-time queries
- Li Chao trees: minimum linear tariff at a chosen quantity