# Minimum Score Triangulation Of Polygon: Walkthrough
Minimum Score Triangulation Of Polygon shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Interval DP: dp[i][j] = min over k of dp[i][k] + dp[k][j] + v[i]*v[k]*v[j], because edge i-j must belong to exactly one triangle.
## 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^3).
## Common mistake
Greedily cutting the largest vertex first.
## 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 https://linkjob.ai.