# Find If Digit Game Can Be Won: Interview Notes
Find If Digit Game Can Be Won shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Alice scores single-digit numbers, Bob scores double-digit numbers; Alice wins if the two sums differ. Sum values < 10 and values >= 10 and compare. (A game the statement calls a win only when Alice's sum != Bob's sum.)
## 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
Comparing counts of single vs double-digit numbers instead of their sums, or treating 10+ as Alice.
## 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.