Practice
Learn
← Quit
0 / 0 correct
Data Structures
Hard
1 of 484
What does a sparse table answer in O(1) after O(n log n) preprocessing?
A
Shortest paths
B
Range minimum (or other idempotent) queries on a static array
C
Set membership
D
Range sums with updates