# Triangle: Explained
Triangle shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Bottom-up DP: each entry becomes itself plus the min of the two children below it; the top cell is the answer and you can overwrite the triangle in place.
## 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^2).
## Common mistake
Top-down greedy that commits to the smaller child and later regrets it.
## 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 here.