# Last Stone Weight: Walkthrough

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

## Key idea

Put every stone in a max-heap. Repeatedly smash the two heaviest: if they differ, push the difference back. The last remaining stone (or zero) is the answer.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (a heap or priority queue, Union-Find, interval scheduling, bitmask DP, a topological order, or a Trie) 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 log n).

## Common mistake

Sorting once and walking linearly, which does not keep the new difference in the right place among the remaining stones.

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