# Find Kth Smallest Pair Distance: Study Guide
Find Kth Smallest Pair Distance shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Sort the array, then binary-search the distance d. A two-pointer scan counts how many pairs have nums[j]-nums[i] <= d; shrink or grow d until the count of pairs <= d is at least k.
## 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 + n log W).
## Common mistake
Generating all n^2 distances and sorting them, which is correct but too slow and memory-heavy.
## 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 copilot.