# Burst Balloons: Practice Notes

Burst Balloons shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Interval DP: dp[l][r] is the best coins from bursting everything strictly between l and r, trying each last balloon k and adding nums[l]*nums[k]*nums[r].

## 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^3).

## Common mistake

Bursting the current max balloon first, which is a greedy that misses a better last-burst order.

## 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 help for online coding assessments.