# Find Missing Observations: Practice Notes
Find Missing Observations shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
n rolls are missing, m rolls are known, and the overall mean is mean. The missing n rolls must be integers in 1..6 summing to mean*(n+m) - sum(known). If that target is outside [n, 6n], impossible. Distribute the target as evenly as possible (base + leftover ones).
## 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
Emitting any n numbers that sum correctly but leaving some outside 1..6, or forgetting to reject an impossible target.
## 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 assistant for technical interviews.