# Smallest Missing Non Negative Integer After Operations: Study Guide
Smallest Missing Non Negative Integer After Operations shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
You may add or subtract value any number of times from each nums[i] (so each value is a residue class mod value). Count frequencies of nums[i] % value and greedily take 0,1,2,... using one token from that residue; the first residue that runs out is the mex.
## 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 + mex).
## Common mistake
Treating the operations as unrestricted increments (ignoring the fixed step) or forgetting that leftovers of residue r can form r, r+value, r+2value, ...
## 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 job interview answers in real time.