# Callahan Kosaraju WSPD: Explained

Callahan Kosaraju WSPD shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Build a fair split tree of the point set and pair well-separated boxes so every pair of points belongs to exactly one well-separated pair.

## 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) pairs for a constant separation ratio, constructed in O(n log n).

## Common mistake

Pairing two boxes that are not well-separated, which lets a later spanner or closest-pair algorithm miss the true closest pair.

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