# Find Missing And Repeated Values: Explained
Find Missing And Repeated Values shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
An n x n grid should contain 1..n^2 each once; one number is repeated and one is missing. Count frequencies (or use math: sum and sum-of-squares vs closed forms) and report [duplicate, missing].
## 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^2).
## Common mistake
Returning the missing number first, or using XOR and then not disentangling the two candidates.
## 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.