# Circle Sweep Closest Pair: Explained

Circle Sweep Closest Pair shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Sweep points by x-coordinate and keep a y-ordered window of points whose x-distance is within the current best, updating the closest pair as you go.

## 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).

## Common mistake

Leaving points in the window whose x-distance already exceeds the best, which makes the y-scan scan too many candidates.

## 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 Linkjob.