✅C++ || Easy Approach ||  Simple Code
Plase Upvote If It Helps\n\n\nclass Solution {\npublic:\n    int minMaxGame(vector<int>& nums) \n    {\n        // if nums size is 1 then return value itself as
**Plase Upvote If It Helps**\n\n```\nclass Solution {\npublic:\n    int minMaxGame(vector<int>& nums) \n    {\n        // if nums size is 1 then return value itself as answer\n        if(nums.size()==1)\n            return nums[0];\n        \n        // define a new vector that will store new min max values\n        vector<int> comb;\n        \n        int n = nums.size();\n        \n        // iterate by n/2 according yo condition\n        for(int i=0;i<n/2;i++)\n        {\n            // even index\n            if(i%2 == 0)\n                comb.push_back(min(nums[2 * i], nums[2 * i + 1]));\n            \n            // odd index\n            else\n                comb.push_back(max(nums[2 * i], nums[2 * i + 1]));\n        }\n        \n        // call recusrion with same function till our comb size reached to the 1\n        int ans = minMaxGame(comb);\n        return ans;\n    }\n};\n```
[]