# Find The Winner Of An Array Game: Practice Notes

Find The Winner Of An Array Game shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

The larger of the first two elements wins and the loser goes to the end; first to win k consecutive comparisons wins (or the max element if k is huge). Scan once: the current champion vs the next unused; if k >= n the max wins immediately.

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

Rotating the array every step in O(n) (total O(nk)) or not short-circuiting when k >= n.

## 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 multilingual AI interview assistant.