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