Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1039. Minimum Score Triangulation of Polygon
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source