Given an array nums, you are allowed to choose one element of nums and change it by any value in one move.
Return the minimum difference between the largest and smallest value of nums after perfoming at most 3 moves.
 
Example 1:
Input: nums = [5,3,2,4]
Output: 0
Explanation: Change the array [5,3,2,4] to [2,2,2,2].
The difference between the maximum and minimum is 2-2 = 0.
Example 2:
Input: nums = [1,5,0,10,14]
Output: 1
Explanation: Change the array [1,5,0,10,14] to [1,1,0,1,1]. 
The difference between the maximum and minimum is 1-0 = 1.

Example 3:
Input: nums = [6,6,0,1,1,4,6]
Output: 2

Example 4:
Input: nums = [1,5,6,14,15]
Output: 1

 
Constraints:

1 <= nums.length <= 10^5
-10^9 <= nums[i] <= 10^9

```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    #original submission\n    def minDifference(self, nums: List[int]) -> int:\n\n        if len(nums) < 5: \n            return 0\n        \n        a = sorted(nums)\n        \n        H = len(nums) - 4\n        L = 0\n        lowest_diff = None\n        for i in range(4):\n            diff = a[H] - a[L]\n            if lowest_diff == None or lowest_diff > diff:\n                lowest_diff = diff\n            H += 1\n            L += 1\n        \n        return lowest_diff\n    '''\n    # faster and cleaner\n    def minDifference(self, nums: List[int]) -> int:\n\n        if len(nums) < 5: \n            return 0\n        \n        nums = sorted(nums)\n        \n        N = len(nums)\n        lowest_diff = None\n        for i in range(4):\n            diff = nums[N-(4-i)] - nums[i]\n            if lowest_diff == None or lowest_diff > diff:\n                lowest_diff = diff\n        \n        return lowest_diff\n    '''\n    '''\n    #original attempt\n    def minDifference(self, nums: List[int]) -> int:\n        \n        N = len(nums)\n        \n        # any array of length 4 or less can have all elements mapped to same value\n        if len(nums) < 5: \n            return 0\n        \n        # sort \n        a = sorted(nums)\n        \n        # compare 'new' low/highs to an updated median\n        L = 0\n        H = len(nums) - 1\n        # counts for those remapped from each side\n        Lc = 0\n        Hc = 0\n        for i in range(3):\n            m = int((L + H + 2)/2)\n            M = a[m]\n            low = a[L]\n            high = a[H]\n            lowDiff = M - low\n            highDiff = high - M\n            # implies we should set the lowest value to the final median\n            if lowDiff > highDiff:\n                L += 1\n                Lc += 1\n            # implies we should set the highest value to the final median\n            elif lowDiff < highDiff:\n                H -= 1\n                Hc += 1\n            # implies the differences are the same - pick the side with a higher count\n            else:\n                if Hc > Lc:\n                    H -= 1\n                    Hc += 1\n                else:\n                    L += 1\n                    Lc += 1\n                    \n        return a[H] - a[L]\n    '''"
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

_target = None
_fn_name = 'minDifference'
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: 5500