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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Hello Interview Premium
Your account is free and you can post anonymously if you choose.