Brute Force || c++ || easy to understand || readable code
did just as mentioned in the problem\n```\nint minMaxGame(vector& nums) {\n        if(nums.size() == 1){\n            return nums[0];\n        }\n        int x 
did just as mentioned in the problem\n```\nint minMaxGame(vector<int>& nums) {\n        if(nums.size() == 1){\n            return nums[0];\n        }\n        int x = nums.size();\n        while(x!=1){\n            x = x/2;\n            for(int i=0;i<x;i++){\n                if(i%2==0){\n                    nums[i] = min(nums[2 * i], nums[2 * i + 1]);\n                }else{\n                    nums[i] = max(nums[2 * i], nums[2 * i + 1]);\n                }\n            }   \n        }\n        return nums[0];   \n    }\n\t
['C']