✔️ EXPLANATION || O ( N ) || PYTHON ||
No need to create new array.\nIt can be seen that changes can be mae within same array.\nThe changed elements are never called again so their positions are usel
No need to create new array.\nIt can be seen that changes can be mae within same array.\nThe changed elements are never called again so their positions are useless and we use those vacant indexes.\n\n```\nclass Solution:\n    def minMaxGame(self, a: List[int]) -> int:\n        \n        def solve(n):\n            if n==1:\n                return\n            for i in range(n//2):\n                if i%2:\n                    a[i] = max (a[2*i], a[2*i+1])\n                else:\n                    a[i] = min (a[2*i], a[2*i+1])\n            solve(n//2)\n            return\n        solve(len(a))\n        return a[0]\n```\n![image](https://assets.leetcode.com/users/images/2cdfd693-ef54-4ccd-bad2-a6068e297956_1654445135.817252.jpeg)\n
['Recursion', 'Python']