You are given a $0$ indexed integer array nums and an integer k.

For each index i ($0 \leq i <$ nums.length), the instability score is defined as the maximum value in the subarray from index $0$ to i minus the minimum value in the subarray from index i to nums.length $- 1$.

An index i is considered stable if its instability score is less than or equal to k.

Return the smallest stable index i. If no such index exists, return $-1$.

Constraints:

• $1 \leq$ nums.length $\leq 100$

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