Easy Java DP Solution
\nclass Solution {\n    public int minScoreTriangulation(int[] arr) {\n        if(arr.length ==3){\n            return arr[0] * arr[1] * arr[2];\n        }\n   
```\nclass Solution {\n    public int minScoreTriangulation(int[] arr) {\n        if(arr.length ==3){\n            return arr[0] * arr[1] * arr[2];\n        }\n        int [][]dp = new int[arr.length][arr.length];\n        \n        for(int gap = 2; gap<arr.length; gap++){\n            for(int left=0; left<arr.length-gap; left++){\n                int right = left + gap;\n                dp[left][right] = Integer.MAX_VALUE;\n                for(int i=left + 1; i<right; i++){\n                dp[left][right] = Math.min(dp[left][right], dp[left][i] + dp[i][right] + arr[left]*arr[i]*arr[right]);\n                }\n            }\n        }\n        \n        return dp[0][dp.length-1];\n    }\n}\n```
[]