[Solution] Min Max Game – LeetCode Weekly Contest 296
![[Solution] Min Max Game - LeetCode Weekly Contest 296 Min Max Game - LeetCode Weekly Contest 296](https://realcoder.techss24.com/wp-content/uploads/2022/06/Min-Max-Game-LeetCode-Weekly-Contest-296.png)
You are given a 0-indexed integer array nums whose length is a power of 2. Apply the following algorithm on nums: Let n be the length of nums. If n == 1, end the process. Otherwise, create a new 0-indexed integer array newNums of length n / 2. For every even index i where 0 <= i < n / 2, assign the value of newNums[i] as min(nums[2 *…