Python Easy Solution
Here we use the concept of recursion , for which we created a new function called game fo easy implementation of our function.\n\nclass Solution:\n    def minMa
Here we use the concept of recursion , for which we created a new function called game fo easy implementation of our function.\n```\nclass Solution:\n    def minMaxGame(self, nums: List[int]) -> int:\n        return Solution().game(nums)\n        \n    def game(self,nums):\n        if len(nums)==1:\n            return nums[0]\n        \n        l=[]\n        for i in range(len(nums)//2):\n            if i%2==0:\n                l.append(min(nums[2 * i], nums[2 * i + 1]))\n            \n            else:\n                l.append(max(nums[2 * i], nums[2 * i + 1]))\n        #print(l)       \n        return Solution().game(l)\n```\nIf u understood the code then plz...UPVOTE...Thnx in adv
['Python']