Simple JavaScript/TypeScript solution
My simple and intuitive solution:\n\nfunction minMaxGame(nums: number[]): number {\n    if (nums.length === 1) return nums[0];\n    if (nums.length === 2) retur
My simple and intuitive solution:\n```\nfunction minMaxGame(nums: number[]): number {\n    if (nums.length === 1) return nums[0];\n    if (nums.length === 2) return Math.min(nums[0], nums[1]);\n    \n    const newNums = [];\n    for (let i = 0; i < nums.length; i+=4) {\n        newNums.push(Math.min(nums[i], nums[i+1]));\n        newNums.push(Math.max(nums[i+2], nums[i+3]));\n    }\n    \n    return minMaxGame(newNums);\n};\n```\n\nRuntime:\xA0100 ms, faster than\xA058.33%\xA0of\xA0TypeScript\xA0online submissions for\xA0Min Max Game.\nMemory Usage:\xA044.9 MB, less than\xA058.33%\xA0of\xA0TypeScript\xA0online submissions for\xA0Min Max Game.\n\n
['TypeScript', 'JavaScript']