Easy Python solution
\nclass Solution:\n    def minMaxGame(self, nums: List[int]) -> int:\n        \n        n = len(nums)\n\t\t\n\t\t# while length of nums is greater than 1 \n    
```\nclass Solution:\n    def minMaxGame(self, nums: List[int]) -> int:\n        \n        n = len(nums)\n\t\t\n\t\t# while length of nums is greater than 1 \n        while(n > 1):\n            newNums = [0 for i in range(n//2)]\n\t\t\t\n\t\t\t# place at even indexes\n            for i in range(0,n//2,2):\n                newNums[i] = min(nums[2 * i], nums[2 * i + 1])\n            \n\t\t\t# place at odd indexes\n            for i in range(1,n//2,2):\n                newNums[i] = max(nums[2 * i], nums[2 * i + 1])\n                \n            nums= newNums\n            \n            n=len(nums)\n            \n        return nums[-1]\n        \n```
['Python']