# Mo's Algorithm For Offline Range Queries: Walkthrough

Mo's Algorithm For Offline Range Queries shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Sort queries by block of the left end, then by right end, and move two pointers while maintaining an add/remove answer.

## 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 + q) * sqrt(n)) pointer moves.

## Common mistake

Using it when the answer cannot be updated by adding or removing a single element.

## 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 the Linkjob AI app.