Minimum Score Triangulation of Polygon(Matrix Multiplication) - Java sol
\n\n# Code\n\nclass Solution {\n    public int minScoreTriangulation(int[] values) {\n        int N = values.length;\n        int[][] dp = new int[N][N];\n     
\n\n# Code\n```\nclass Solution {\n    public int minScoreTriangulation(int[] values) {\n        int N = values.length;\n        int[][] dp = new int[N][N];\n        for(int len=2; len<N; len++){\n            for(int row=0, col=len; row<N-len; row++, col++){\n                dp[row][col] = Integer.MAX_VALUE;\n                for(int k=row+1; k<col; k++){\n                    dp[row][col] = Math.min(dp[row][col], dp[row][k] + dp[k][col] + values[row]*values[k]*values[col]);\n                }\n            }\n        }\n        return dp[0][N-1];\n    }\n}\n```
['Dynamic Programming', 'Java']