Given a non-empty array of non-negative integers nums, the degree of this array is defined as the maximum frequency of any one of its elements.
Your task is to find the smallest possible length of a (contiguous) subarray of nums, that has the same degree as nums.

Example 1:

Input: [1, 2, 2, 3, 1]
Output: 2
Explanation: 
The input array has a degree of 2 because both elements 1 and 2 appear twice.
Of the subarrays that have the same degree:
[1, 2, 2, 3, 1], [1, 2, 2, 3], [2, 2, 3, 1], [1, 2, 2], [2, 2, 3], [2, 2]
The shortest length is 2. So return 2.




Example 2:

Input: [1,2,2,3,1,4,2]
Output: 6



Note:
nums.length will be between 1 and 50,000.
nums[i] will be an integer between 0 and 49,999.

```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 findShortestSubArray(self, nums):\n         """\n         :type nums: List[int]\n         :rtype: int\n         """\n         r={}\n         for i,j in enumerate(nums):\n             if j not in r:\n                 r[j]=1+100000*i\n             else:\n                 r[j]=r[j]%10000000000+1+10000000000*i\n         tem=1\n         dist=500000\n         print(r)\n         for i in list(r.values()):\n             print(i)\n             if i%100000==tem:\n                 if tem==1:\n                     dist=1\n                 else:\n                     dist_tem=i//10000000000-(i//100000)%100000+1\n                     if dist_tem<dist:\n                         dist=dist_tem\n             elif i%100000>tem:\n                 tem=i%100000\n                 dist=i//10000000000-(i//100000)%100000+1\n         return dist\n             \n                 \n        #  x=[0 for i in range(50000)]\n        #  for i in range(len(nums)):\n        #      x[nums[i]]=x[nums[i]]+1\n        #      if x[nums[i]]==1:\n        #          x[nums[i]]=x[nums[i]]+100000*i\n        #      else:\n        #          x[nums[i]]=x[nums[i]]%10000000000+10000000000*i\n        #  tem=1\n        # # print(x)\n        #  dist=50000\n        #  for i in x:\n        #     # print(i)\n        #      if i>0:\n        #          if i%100000==tem:\n        #              tem=i%100000\n        #              if tem==1:\n        #                  dist=1\n        #              else:\n        #                  dist_tem=i//10000000000-(i//100000)%100000+1\n        #                  if dist_tem<dist:\n        #                      dist=dist_tem\n        #          elif i%100000>tem:\n        #              tem=i%100000\n        #              dist=i//10000000000-(i//100000)%100000+1\n        #         # print(dist)\n        #  return dist\n     \n             \n'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

_target = None
_fn_name = 'findShortestSubArray'
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: 6443