Leetcode 1039. Minimum Score Triangulation of Polygon

Given a convex n-gon with integer values at vertices, find a triangulation that minimizes the sum of triangle weights where each triangle's weight is the product of its three vertex values. This is an interval/partitioning DP problem (analogous to matrix-chain multiplication) over vertex ranges with n ≤ 50.