Python Recursion Solution
\nclass Solution:\n    def helper(self,nums):\n        n = len(nums)\n        \n        if(n == 1): return nums[0]\n        \n        newNums = [0 for i in rang
```\nclass Solution:\n    def helper(self,nums):\n        n = len(nums)\n        \n        if(n == 1): return nums[0]\n        \n        newNums = [0 for i in range(n//2)]\n        \n        for i in range(n//2):\n            if(i%2==0):\n                newNums[i] = min(nums[2 * i], nums[2 * i + 1])\n            else:\n                newNums[i] = max(nums[2 * i], nums[2 * i + 1])\n        return self.helper(newNums)\n        \n        \n    def minMaxGame(self, nums: List[int]) -> int:\n        return self.helper(nums)\n        \n```
['Recursion', 'Python']