Given an integer array nums of length n, find the maximum of the minimum values of all subarrays of each possible length from $1$ to n.

Return an array of length n where the element at index i is the maximum among the minimum values of all contiguous subarrays of length $i + 1$.

Constraints:

• n $==$ nums.length

• $1 \leq$ n $\leq 10^5$

• $0 \leq$ nums[i] $\leq 10^9$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.