Jump Game IV

Given an array of integers arr, you are initially positioned at the first index of the array.

In one step you can jump from index i to index:

  • i + 1 where i + 1 < arr.length.
  • i - 1 where i - 1 >= 0.
  • j where arr[i] == arr[j] and i != j.

Return the minimum number of steps to reach the last index of the array.

Notice that you can not jump outside of the array at any time.

Example 1
Inputarr = [100,-23,-23,404,100,23,23,23,3,404]
Output3
You need three jumps from index 0 --> 4 --> 3 --> 9, and index 9 is the last index of the array.
Example 2
Inputarr = [7]
Output0
Start index is the last index, so you do not need to jump.

Constraints

  • 1 <= arr.length <= 5 * 10^4
  • -10^8 <= arr[i] <= 10^8

Asked at 3 companies

</>

Your Solution

(Ctrl/Cmd + Enter)

Switching Language

Loading template...

Loading...

Sign in to save your progress

AI code evaluation

Get a correctness verdict, missed edge cases, and complexity analysis of your solution.

Sign in to evaluate