# Farach Colton Bender RMQ: Explained
Farach Colton Bender RMQ shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Reduce RMQ to LCA on the Cartesian tree, then to +/-1 RMQ on the Euler tour, which is solved with a sparse table over blocks of size (1/2) log n.
## 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) preprocess and O(1) query.
## Common mistake
Using a standard sparse table on the raw array instead of the +/-1 Euler-tour sequence, which is no longer linear-preprocessable in the same way.
## 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 AI tool for job interviews.