Minimum Score Triangulation of Polygon
Code


# Code
```python []
class Solution(object):
    def minScoreTriangulation(self, values):
        """
        :type values: List[int]
        :rtype: int
        """
        n = len(values)
        dp = [[0] * n for _ in range(n)]

        for length in range(2, n):  
            for i in range(n - length):  
                j = i + length  
                dp[i][j] = float('inf')  

                for k in range(i + 1, j):  
                    dp[i][j] = min(dp[i][j], dp[i][k] + dp[k][j] + values[i] * values[k] * values[j])

        return dp[0][n-1]

```
['Array', 'Dynamic Programming', 'Python']