📌💯 100% FASTER ♨️JAVA CODE || 📌 USING RECURSION
\nclass Solution {\n    public int minMaxGame(int[] nums) {\n       if(nums.length==1)\n           return nums[0];\n        int index=0;\n        int count=0;\n
```\nclass Solution {\n    public int minMaxGame(int[] nums) {\n       if(nums.length==1)\n           return nums[0];\n        int index=0;\n        int count=0;\n        int[] out=new int[nums.length/2];\n        for(int i=0;i<nums.length-1;i=i+2){\n            if(count%2==0)\n                out[index]=Math.min(nums[i],nums[i+1]);\n            else\n                out[index]=Math.max(nums[i],nums[i+1]);\n            count++;\n            index++;\n        }\n        return minMaxGame(out);\n    }\n}\n```
['Recursion', 'Java']