Python || Easy Solution
\tclass Solution:\n\t\tdef minMaxGame(self, nums: List[int]) -> int:\n\t\t\tif len(nums) == 1: return nums[0]\n\t\t\tnewNums = [0](len(nums)//2)\n\t\t\tfor i in
\tclass Solution:\n\t\tdef minMaxGame(self, nums: List[int]) -> int:\n\t\t\tif len(nums) == 1: return nums[0]\n\t\t\tnewNums = [0]*(len(nums)//2)\n\t\t\tfor i in range(len(nums)//2):\n\t\t\t\tif i % 2 == 0:\n\t\t\t\t\tnewNums[i] = min( nums[2*i], nums[2*i + 1]  )\n\t\t\t\telse: newNums[i] = max(nums[2*i], nums[2*i + 1] )\n\t\t\treturn self.minMaxGame(newNums)
['Python', 'Python3']