# Stone Game VIII: Explained
Stone Game VIII shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Prefix sums x[i] = stones[0]+...+stones[i]. A move takes a prefix i>=1 and replaces the pile by x[i] as the new start; the player scores x[i]. DP from the right: the current player takes max_i x[i] - opponent_best_after_that.
## 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) after prefixes.
## Common mistake
Scoring the raw prefix without subtracting the opponent’s best continuation, which overcounts.
## 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 Linkjob.