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:**

**Example 2:**

Jump Game IV

**Example 3:**

package Solution

funcSolution(xbool)bool {

funcSolution(arr []int)int {

length:=len(arr)

iflength<=1 {

}

indices:=make(map[int][]int)

visited:=make([]bool,length)

fori:=0;i<length;i++ {

if_,ok:=indices[arr[i]];!ok {

indices[arr[i]]=make([]int,0)

}

indices[arr[i]]=append(indices[arr[i]],i)

}

visited[0]=true

queue:= []int{0}

forlen(queue)>0 {

nextQ:=make([]int,0)

for_,index:=rangequeue {

ifindex-1>=0&&!visited[index-1] {

visited[index-1]=true

nextQ=append(nextQ,index-1)

}

ifindex+1<length&&!visited[index+1] {

visited[index+1]=true

nextQ=append(nextQ,index+1)

}

for_,rel:=rangeindices[arr[index]] {

if!visited[rel] {

visited[rel]=true

nextQ=append(nextQ,rel)

}

}

delete(indices,arr[index])

}

ifvisited[length-1] {

}

}

}

cases:= []struct {

}{

{"TestCase",true,true},

{"TestCase",true,true},

{"TestCase",false,false},

{"TestCase1",[]int{100,-23,-23,404,100,23,23,23,3,404},3},

{"TestCase2",[]int{7},0},

{"TestCase3",[]int{7,6,9,6,9,6,9,7},1},

}

}

}

funcBenchmarkSolution(b*testing.B) {

}

funcExampleSolution() {

}