# Cyclic Sort For Missing Numbers: Practice Notes
Cyclic Sort For Missing Numbers shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Swap each value into index value-1 until every slot holds its value or a duplicate.
## 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).
## Common mistake
Swapping without checking that the target already holds the same value, which loops forever.
## 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 multilingual AI interview assistant.