[PYTHON 3] DP | Iterative Solution
\nclass Solution:\n    def minScoreTriangulation(self, A: List[int]) -> int:\n        n = len(A)\n        dp = [[0 for i in range(n)] for j in range(n)]\n      
```\nclass Solution:\n    def minScoreTriangulation(self, A: List[int]) -> int:\n        n = len(A)\n        dp = [[0 for i in range(n)] for j in range(n)]\n        for k in range(2 , n):\n            for i in range(n - k):\n                start , end = i , i + k\n                dp[start][end] = float("inf")\n                for j in range(start + 1 , end):\n                    dp[start][end] = min(dp[start][end] , dp[start][j] + dp[j][end] + A[start] * A[end] * A[j])\n        return dp[0][-1]\n```
['Dynamic Programming', 'Iterator', 'Python3']