# Quadtree Orthogonal Range Count: Interview Notes

Quadtree Orthogonal Range Count shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Recursively split the plane into four quadrants and stop at capacity; a range query adds fully covered nodes and recurses only into partial overlaps.

## 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) expected build for well-spread points, query depends on the range boundary.

## Common mistake

Splitting past a capacity of one on duplicate coordinates, which can recurse forever.

## 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 interview assistant.