# Stone Game IX: Practice Notes
Stone Game IX shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Only residue counts modulo 3 matter. If there are no 1s or no 2s the first player wins iff the other residue count is a multiple of 3 but not zero in the right way; otherwise compare count[1] vs count[2] and the 0-count parity. Work from the formal case table rather than simulating.
## 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
Simulating the whole game or treating 0-residue stones as scoring stones rather than parity-flip skips.
## 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 https://www.linkjob.ai/.