# Moving Stones Until Consecutive II: Interview Notes

Moving Stones Until Consecutive II shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Max moves are max(pos[n-1]-pos[1], pos[n-2]-pos[0])-(n-2). Min moves use a sliding window of size n and a special case when the stones are almost consecutive.

## 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

Using the three-stone Moving Stones I formulas, which do not generalize.

## 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.ai.