# Find Winner On A Tic Tac Toe Game: Practice Notes

Find Winner On A Tic Tac Toe Game shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

moves alternate X and O on a 3x3 board. After each move check the row, column, and diagonals of that cell. Return A/B if someone already won, Draw if the board is full, Pending otherwise. Earlier moves cannot be overwritten.

## 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(1) after 9 moves.

## Common mistake

Continuing after a win (later extra moves are invalid in the input, but you should stop), or checking only rows.

## 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/.