Implement Sparse Table for range minimum queries.
Implementation details:
- is the number of power-of-2 lengths needed
- The inner loop bound
n - (1 << j) + 1ensures we don't exceed array bounds - Precomputed LOG array avoids expensive log calls Testing:
- Single element range
- Entire array range
- Random ranges
- Verify against brute force for small inputs For queries on elements, Sparse Table answers each query in vs. for a segment tree.
Time: . Space: .