# Predict The Winner: Walkthrough

Predict The Winner shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Minimax / interval DP: the current player takes nums[l] or nums[r] and the score is that value minus the opponent's best reply on the leftover interval (or store both scores).

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (graph BFS, Dijkstra, Union-Find, or interval DP) and why a simpler scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n^2).

## Common mistake

Always grabbing the current larger end, which loses on arrays like [1,5,2].

## 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 real-time AI interview assistant for live interviews.