You are given an integer array nums and an integer k.

For each index i where $0 \leq i <$ nums.length, the instability score is defined as the difference between the maximum value in the subarray from index $0$ to i inclusive and the minimum value in the subarray from index i to nums.length $- 1$ inclusive.

Return the smallest index i such that the instability score at index i is less than or equal to k. If no such index exists, return $-1$.

Constraints:

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

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

• $0 \leq$ k $\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.