You are given a $0$ indexed integer array nums.

Starting at an index i, you can jump to another index j if and only if one of the following conditions is satisfied:

• $j < i$ and nums[j] $>$ nums[i]

• $j > i$ and nums[j] $<$ nums[i]

You can perform any number of jumps.

Return an array ans of the same length as nums, where ans[i] represents the maximum value in nums that can be reached starting from index i.

Constraints:

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

• $1 \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.