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:
Input: arr = [100,-23,-23,404,100,23,23,23,3,404]
Output: 3
Explanation: You need three jumps from index 0 --> 4 --> 3 --> 9. Note that index 9 is the last index of the array.

Example 2:
Input: arr = [7]
Output: 0
Explanation: Start index is the last index. You don't need to jump.

Example 3:
Input: arr = [7,6,9,6,9,6,9,7]
Output: 1
Explanation: You can jump directly from index 0 to index 7 which is last index of the array.

Example 4:
Input: arr = [6,1,9]
Output: 2

Example 5:
Input: arr = [11,22,7,7,7,7,7,7,7,22,13]
Output: 3

 
Constraints:

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

```python

USER_FILENAME = "<user_code>"
import sys, json, builtins
import math, heapq, bisect, itertools, functools, collections, statistics, fractions, decimal, operator, array, random, re, string, os, pathlib
try:
    import resource as _res
except Exception:
    _res = None
from collections import Counter, defaultdict, deque, OrderedDict
from functools import lru_cache, reduce
from itertools import accumulate, permutations, combinations, product
from math import gcd, ceil, floor, sqrt
from decimal import Decimal
try:
    from typing import *
except Exception:
    pass
try:
    sys.setrecursionlimit(1_000_000)
except Exception:
    pass
try:
    import site as _site
    try:
        _sys_sites = _site.getsitepackages() if hasattr(_site, "getsitepackages") else []
        for _p in _sys_sites:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
    try:
        _usp = _site.getusersitepackages()
        if isinstance(_usp, str):
            _usp = [_usp]
        for _p in _usp:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
except Exception:
    pass

def _disabled_input(*args, **kwargs):
    raise RuntimeError("input() is disabled in callable mode")
builtins.input = _disabled_input

ns = {"__name__": "__judge__"}  # prevent if __name__ == "__main__" blocks
for _k, _v in list(globals().items()):
    if not _k.startswith("_"):
        ns[_k] = _v
_CODE = 'class Solution:\n    def minJumps(self, arr: List[int]) -> int:\n        # BFS\n        A = arr\n        n = len(A)\n        q = []\n        val_dic = collections.defaultdict(list)\n        for i, val in enumerate(A):\n            if len(val_dic[val]) > 0:\n                last_range = val_dic[val][-1]\n                if last_range[1]+1 == i:\n                    last_range[1] = i\n                else:\n                    val_dic[val].append([i,i])\n            else:\n                val_dic[val].append([i,i])\n                \n        walked_val = set()\n        # for i in val_dic[A[0]]:\n        q.append(0)\n            \n        walked = set()\n        steps = -1\n        while len(q) > 0:\n            # print(q)\n            cur_len = len(q)\n            next_q = []\n            for i in q:\n                val = A[i]\n                if i == n-1:\n                    return steps+1\n                \n                walked.add(i)\n                \n                if i+1 < n and i+1 not in walked:\n                    next_q.append(i+1)\n                if i-1 > -1 and i-1 not in walked:\n                    next_q.append(i-1)\n                if val not in walked_val:\n                    index_range_list = val_dic[val]\n                    for index_range in index_range_list:\n                        for j in (index_range[0], index_range[1]):\n                            if j != i and j not in walked:\n                                next_q.append(j)\n                        walked_val.add(val)\n                \n            steps += 1\n            q = next_q\n        return steps\n\n\n\n# class Solution:\n#     def minJumps(self, arr: List[int]) -> int:\n#         # BFS\n#         A = arr\n#         n = len(A)\n#         q = collections.deque()\n#         val_dic = collections.defaultdict(list)\n#         for i, val in enumerate(A):\n#             if len(val_dic[val]) > 0:\n#                 last_range = val_dic[val][-1]\n#                 if last_range[1]+1 == i:\n#                     last_range[1] = i\n#                 else:\n#                     val_dic[val].append([i,i])\n#             else:\n#                 val_dic[val].append([i,i])\n                \n#         walked_val = set()\n#         # for i in val_dic[A[0]]:\n#         q.append(0)\n            \n#         walked = set()\n#         steps = -1\n#         while len(q) > 0:\n#             # print(q)\n#             cur_len = len(q)\n#             for _ in range(0,cur_len):\n                \n#                 i = q.popleft()\n#                 val = A[i]\n#                 if i == n-1:\n#                     return steps+1\n                \n#                 walked.add(i)\n                \n#                 if i+1 < n and i+1 not in walked:\n#                     q.append(i+1)\n#                 if i-1 > -1 and i-1 not in walked:\n#                     q.append(i-1)\n\n#                 # 不要去遍历和自己的值相同的元素，如果不便利，就增加不进去。\n#                 # 如果这个值已经被遍历过了，就不要再次遍历。\n                \n#                 if val not in walked_val:\n#                     index_range_list = val_dic[val]\n#                     for index_range in index_range_list:\n#                         for j in (index_range[0], index_range[1]):\n#                             if j != i and j not in walked:\n#                                 q.append(j)\n#                         walked_val.add(val)\n                \n#             steps += 1\n                \n#         return steps\n'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

_target = None
_fn_name = 'minJumps'
if _fn_name:
    if "Solution" in ns:
        try:
            _obj = ns["Solution"]()
            if hasattr(_obj, _fn_name):
                _target = getattr(_obj, _fn_name)
        except Exception:
            _target = None
    if _target is None and _fn_name in ns and callable(ns[_fn_name]):
        _target = ns[_fn_name]
# Fallback: if there's exactly one user-defined function, use it
if _target is None:
    _cands = [v for k, v in ns.items() if callable(v) and getattr(v, "__module__", "") in ("__judge__", "__main__")]
    _user_funcs = [c for c in _cands if getattr(c, "__name__", "").startswith("_") is False]
    if len(_user_funcs) == 1:
        _target = _user_funcs[0]
if _target is None:
    raise RuntimeError(f"Could not resolve callable '{_fn_name}'")

_raw = sys.stdin.read().strip()
if _raw:
    _parsed = json.loads(_raw)
    if isinstance(_parsed, dict):
        _kwargs = _parsed.get("kwargs", {})
        _args = _parsed.get("args", [])
    else:
        _args, _kwargs = _parsed, {}
else:
    _args, _kwargs = [], {}
if not isinstance(_args, (list, tuple)):
    _args = [_args]
_res = _target(*_args, **_kwargs)
try:
    sys.stdout.write(repr(_res) + "\n")
except Exception:
    pass

```

Measured memory_bytes: 8376