Given a $0$ indexed integer array nums consisting of unique values.

For each index i, determine the length of the longest contiguous subarray where nums[i] is the maximum element.

Return an array ans of the same length, where ans[i] is the length of this maximal subarray for the element at index i.

Constraints:

• $1 \leq$ nums.length $\leq 10^5$

• $1 \leq$ nums[i] $\leq 10^5$

• All elements in nums are distinct.

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.