Given an array of integers nums and an integer limit, return the size of the longest non-empty subarray such that the absolute difference between any two elements of this subarray is less than or equal to limit.
 
Example 1:
Input: nums = [8,2,4,7], limit = 4
Output: 2 
Explanation: All subarrays are: 
[8] with maximum absolute diff |8-8| = 0 <= 4.
[8,2] with maximum absolute diff |8-2| = 6 > 4. 
[8,2,4] with maximum absolute diff |8-2| = 6 > 4.
[8,2,4,7] with maximum absolute diff |8-2| = 6 > 4.
[2] with maximum absolute diff |2-2| = 0 <= 4.
[2,4] with maximum absolute diff |2-4| = 2 <= 4.
[2,4,7] with maximum absolute diff |2-7| = 5 > 4.
[4] with maximum absolute diff |4-4| = 0 <= 4.
[4,7] with maximum absolute diff |4-7| = 3 <= 4.
[7] with maximum absolute diff |7-7| = 0 <= 4. 
Therefore, the size of the longest subarray is 2.

Example 2:
Input: nums = [10,1,2,4,7,2], limit = 5
Output: 4 
Explanation: The subarray [2,4,7,2] is the longest since the maximum absolute diff is |2-7| = 5 <= 5.

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

 
Constraints:

1 <= nums.length <= 10^5
1 <= nums[i] <= 10^9
0 <= limit <= 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 = "import heapq\nclass Solution:\n    def longestSubarray(self, nums: List[int], limit: int) -> int:\n        \n        minheap=[]\n        maxheap=[]\n        heapq.heapify(minheap)\n        heapq.heapify(maxheap)\n        \n        heapq.heappush(minheap,[nums[0],0]) # add first element and its index\n        heapq.heappush(maxheap,[-nums[0],0])\n\n        \n        begin = 0\n        length = 1        \n        end = 1\n        next_idx = 0\n        while begin <= end and end <= len(nums) - 1:\n            \n            if abs(minheap[0][0] - nums[end]) <= limit and abs(abs(maxheap[0][0]) - nums[end]) <= limit:\n                length = max(length, (end - begin) + 1)\n\n            else:\n                while len(minheap) > 0 and abs(minheap[0][0] - nums[end]) > limit:\n                    ele,idx = heapq.heappop(minheap)\n                    next_idx = max(next_idx, idx)\n                while len(maxheap) > 0 and abs(-maxheap[0][0] - nums[end]) > limit:\n                    ele,idx = heapq.heappop(maxheap)\n                    next_idx = max(next_idx, idx)\n                begin = next_idx + 1 \n            heapq.heappush(minheap, [nums[end],end])\n            heapq.heappush(maxheap, [-nums[end],end])\n            end+=1\n        return length\n        \n#         def isValid(int_diff, j, max_value, min_value, limit, nums):\n#             max_boundary = abs(max_value - nums[j])\n#             min_boundary = abs(min_value - nums[j])\n#             return int_diff <= limit and max_boundary <= limit and min_boundary <= limit\n        \n#         def find_error(int_diff,i, j, max_value, min_value, limit, nums,cache):\n#             max_boundary = abs(max_value - nums[j])\n#             min_boundary = abs(min_value - nums[j])\n            \n#             if int_diff > limit: return i\n#             if max_boundary > limit: return cache[max_value]\n#             if min_boundary > limit: return cache[min_value]\n            \n#         output = 1\n#         i = 0\n#         idx = 0\n#         cache = defaultdict(int)\n#         while i < len(nums) and idx < len(nums)-1:\n#             min_value = float('inf')\n#             max_value = float('-inf')\n#             cache[min_value] = i\n#             cache[max_value] = i\n#             for j in range(i,len(nums)):\n                \n#                 int_diff = abs(nums[j] - nums[i])\n#                 temp_min = min_value\n#                 temp_max = max_value\n#                 min_value = min(min_value, nums[j])\n#                 max_value = max(max_value, nums[j])\n#                 if temp_min != min_value:\n#                     cache[min_value] = j\n#                 if temp_max != min_value:\n#                     cache[max_value] = j\n#                 if isValid(int_diff, j, max_value, min_value, limit, nums):\n#                     output = max(output, (j - i) + 1)\n#                 else:\n#                     i = find_error(int_diff, i, j, max_value, min_value, limit, nums,cache) + 1\n                    \n#                     break\n#                 idx = j\n#         return output\n                \n                \n        \n            \n"
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

_target = None
_fn_name = 'longestSubarray'
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: 7002