331. Jump Game IV
HardBFS
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.
Examples
Input: [100,-23,-23,404,100,23,23,23,3,404]
Output: 3
Explanation: 0→4 (equal 100), 4→3 (adjacent), 3→9 (equal 404). Three steps to the last index.
Constraints
- 1 <= arr.length <= 5 * 10^4
- -10^8 <= arr[i] <= 10^8
Loading...
Run checks all cases above. Submit evaluates all test cases.