# Find K Closest Elements: Explained
Find K Closest Elements shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Binary search the left bound of the window of size k: compare x-arr[mid] vs arr[mid+k]-x and slide the window toward the closer side.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (two pointers, a sliding window, prefix sums, a monotonic stack, or binary search on the answer) and why a linear nested scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(log(n-k) + k).
## Common mistake
Sorting by absolute distance, which loses the required sorted-order output more expensively.
## 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 www.linkjob.ai.