✅ One Line Solution
(Disclaimer: this is not an example to follow in a real project - it is written for fun and training mostly)\n \n\nTime complexity: O(n^2). Space complexity: O(
(Disclaimer: this is not an example to follow in a real project - it is written for fun and training mostly)\n<!--  -->\n\nTime complexity: $$O(n^2)$$. Space complexity: $$O(n^2)$$\n```\nclass Solution:\n    def minScoreTriangulation(self, v: List[int]) -> int:\n        return (f:=cache(lambda i,j:j-i>1 and min(f(i,k)+v[i]*v[k]*v[j]+f(k,j) for k in range(i+1,j))))(0,len(v)-1)\n```\n\n(Disclaimer 2: all code above is just a product of fantasy, it is not claimed to be pure impeccable oneliners - please, remind about drawbacks only if you know how to make it better. PEP 8 is violated intentionally)
['Array', 'Dynamic Programming', 'Recursion', 'Memoization', 'Python', 'Python3']