# K Closest Points To Origin: Explained
K Closest Points To Origin shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Keep a max-heap of size k keyed by squared distance. Push every point and pop the farthest whenever the heap grows past k, so the heap always holds the k closest.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (a heap or priority queue, Union-Find, interval scheduling, bitmask DP, a topological order, or a Trie) 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 k).
## Common mistake
Sorting all n points, which is correct but slower than a bounded heap or quickselect.
## 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.