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