Python Solution
\nclass Solution:\n    def minMaxGame(self, nums: List[int]) -> int:\n        f, p, l = [min, max], 0, len(nums)\n        while l > 1:\n            for i in ran
```\nclass Solution:\n    def minMaxGame(self, nums: List[int]) -> int:\n        f, p, l = [min, max], 0, len(nums)\n        while l > 1:\n            for i in range(0, l, 2):\n                nums[i // 2] = f[p](nums[i:i + 2])\n                p = 1 - p\n            l = l // 2\n        return nums[0]\n```
[]