Constant Space C++ Solution
\nint minMaxGame(vector<int>& nums) {\n        int n = nums.size();\n        while(n > 1) {            \n            for(int i = 0; i < n / 2; i++) {\n         
```\nint minMaxGame(vector<int>& nums) {\n        int n = nums.size();\n        while(n > 1) {            \n            for(int i = 0; i < n / 2; i++) {\n                if(i % 2 == 0) {\n                    nums[i] = min(nums[2 * i], nums[2 * i + 1]);\n                }\n                else {\n                    nums[i] = max(nums[2 * i], nums[2 * i + 1]);\n                }\n            }\n            n /= 2;\n        }\n        return nums[0];\n    }\n```
['C']