# Smallest Missing Non-negative Integer After Operations (LC4906) Interview Notes
LeetCode-style prep note: restate the problem, clarify constraints, then walk a correct approach with complexity.
1. Clarify input bounds and required output.
2. Start from a correct brute force, then optimize.
3. Use hashing / two pointers / DP / graphs as needed.
4. Keep invariants explicit while coding.
- Time: aim for the tightest practical bound under constraints
- Space: reuse buffers when possible
- Overflow and modular arithmetic
- Disconnected graph components
Narrate trade-offs and test a tiny example first. I keep [real-time interview help](https://www.linkjob.ai/interview-copilot/) handy as a real-time AI interview assistant when company policy allows.
Prepared for personal interview prep — LC4906.