# Mo Algorithm Hilbert Order: Study Guide

Mo Algorithm Hilbert Order shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Sort offline queries by their position along a Hilbert curve of the (L, R) plane so consecutive queries share most of their interval and the total movement is nearly optimal.

## 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 sqrt q) or better (about O(n sqrt q) times a smaller constant than block-order Mo).

## Common mistake

Sorting by Hilbert rank of L alone instead of the pair (L, R), which does not cluster query rectangles.

## 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 best AI tool for coding tests and OAs.