# Count The Number Of Winning Sequences: Interview Notes
Count The Number Of Winning Sequences shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Alice and Bob play n rounds with moves F/W/E in a cyclic advantage; Bob cannot repeat the previous move; count Bob's winning sequences (strictly more points) modulo 1e9+7 given Alice's fixed string. DP: (round, bob_last_move, score_diff offset).
## 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 * 3 * n).
## Common mistake
Allowing Bob to repeat a move, or only counting sequences that win every round.
## 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 this tool.