You are given a $0$ indexed integer array nums of length n and an integer target.

You start at index $0$. In a single move, you can jump from index i to any index j such that $0 \leq i < j < n$ and $-`target` \leq `nums[j]` - `nums[i]` \leq `target`$.

Return the maximum number of jumps needed to reach index $n - 1$. If it is impossible to reach index $n - 1$, return $-1$.

Constraints:

• $2 \leq$ nums.length $= n \leq 1000$

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

• $0 \leq$ target $\leq 2 imes 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.