# Min Max Game: Walkthrough
Min Max Game shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
While more than one number remains, each pair collapses to a min on even pair-indices and a max on odd pair-indices. Simulate the tournament until one value remains.
## 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
Always taking the min of every pair, or using overlapping pairs.
## 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 try it free.