Given an integer array arr, you initially start at the first index $0$.

In a single step, from your current index i, you can jump to:

• i + $1$, provided that i + $1 <$ arr.length.

• i - $1$, provided that i - $1 \geq 0$.

• Any index j such that arr[i] == arr[j] and i $\neq$ j.

Return the minimum number of jumps needed to reach the last index of the array.

Constraints:

• $1 \leq$ arr.length $\leq 5 \times 10^4$

• $-10^8 \leq$ arr[i] $\leq 10^8$

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.