# Sparse Table For Static Range Minimum: Interview Notes

Sparse Table For Static Range Minimum shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Precompute min over every power-of-two block; answer a query with two overlapping blocks of size 2^k.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n log n) build, O(1) query.

## Common mistake

Using it on an array that changes; any update forces a full rebuild.

## Practice tip

Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at this tool.