LeetCode 1039 Minimum Score Triangulation of Polygon - Problem Statement

Triangulate a convex polygon to find the lowest sum of triangle scores. Score of triangle = product of vertices. $dp[i][j]$ = min cost to triangulate the polygon formed by vertices $i$ to $j$.

Transition: pick a vertex $k$ between $i$ and $j$ to form triangle $(i, k, j)$. Cost = $v[i] \cdot v[k] \cdot v[j] + dp[i][k] + dp[k][j]$. This is Matrix Chain in disguise! The "matrices" are edges, and triangles are the "multiplications".