Range Queries
Everything on SkillVeris tagged Range Queries — collected across the glossary, study notes, blog, and cheat sheets.
4 resources across 1 library
Interview Questions(4)
What is a B+ Tree and Why Do Databases Use It?
A B+ tree is a self-balancing, multi-way search tree where all actual data (or record pointers) lives only in the leaf nodes, internal nodes hold only routing…
What is the Sparse Table Technique?
A sparse table is a precomputed 2D array that answers range minimum, maximum, or GCD queries on a static array in O(1) time after O(n log n) preprocessing, by…
What is Mo's Algorithm?
Mo's algorithm answers many offline range queries on a static array efficiently by sorting queries into blocks of size sqrt(n) and moving a sliding [L, R] wind…
What is a Disjoint Sparse Table?
A disjoint sparse table is a variant of the sparse table that answers O(1) range queries for any associative operation — not just idempotent ones — by precompu…