# Stone Game II: Practice Notes

Stone Game II shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Minimax DP on (index, M): Alice takes X in 1..2M piles and then faces the opponent's best reply; memoize the best remaining stones she can guarantee.

## 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 taking 2M piles, which can leave Bob a huge later streak.

## 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 AI interview helper that uses your resume.