# Stone Game IV: Study Guide

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

## Key idea

Alice and Bob take turns removing a square number of stones from a pile of n. DP[i] is true if the player to move from i stones can force a win (there exists a square k^2 such that DP[i-k^2] is false).

## 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 sqrt n).

## Common mistake

Using the Stone Game I even/odd trick, which does not apply once the only legal moves are square counts.

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