# Minimum Cost To Merge Stones: Interview Notes

Minimum Cost To Merge Stones shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Only possible when (n-1)%(k-1)==0. Interval DP: merge a range into 1 pile after first splitting it into k sub-piles; add the range sum on a full merge.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (bitmasks, backtracking with pruning, 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^3 / k).

## Common mistake

Trying to merge when (n-1) is not divisible by (k-1), which can never finish at one pile.

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