Easy solution
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```typescript []\nfunction minMaxGame(nums: number[]): number {\n\n \n    while (nums.length > 1) {\n        const newNums: number[] = [];\n\n        for (let i = 0; i < nums.length / 2; i++) {\n            if (i % 2 === 0) {\n               \n                newNums[i] = Math.min(nums[2 * i], nums[2 * i + 1]);\n            } else {\n               \n                newNums[i] = Math.max(nums[2 * i], nums[2 * i + 1]);\n            }\n        }\n\n        nums = newNums; \n    }\n\n    return nums[0]; \n\n    \n};\n```
['TypeScript', 'JavaScript']