🔥🔥Easy Python Solution🔥🔥
Intuition\n Describe your first thoughts on how to solve this problem. we have to compare the values until the length of the list is 1.\n\n# Approach\n Describe
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->we have to compare the values until the length of the list is 1.\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\nIterate while until the length of the list is single value\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\nO(n)\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\nO(1)\n# Code\n```\nclass Solution:\n    def minMaxGame(self, nums: List[int]) -> int:\n        i=0\n        x=[]\n        y=True\n        while i<=len(nums):\n            if i==len(nums):\n                nums=x\n                x=[]\n                i=0\n            if y:\n                x.append(min(nums[i:i+2]))\n                i=i+2\n                y=False\n            else:\n                x.append(max(nums[i:i+2]))\n                i=i+2\n                y=True\n        return x[0]\n```
['Python3']