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 = 'class Solution:\n\n    def longestSubarray(self, nums: List[int], limit: int) -> int:\n        n = len(nums)\n        max_q = deque() #3,2,1,0\n        min_q = deque() #1,2,3,4\n\n        start = 0\n        ans = 0\n        for end in range(n):\n            while max_q and max_q[-1] < nums[end]:\n                max_q.pop()\n            while min_q and min_q[-1] > nums[end]:\n                min_q.pop()\n            max_q.append(nums[end])\n            min_q.append(nums[end])\n            \n            if max_q[0] - min_q[0] > limit:\n                if max_q[0] == nums[start]:\n                    max_q.popleft()\n                \n                if min_q[0] == nums[start]:\n                    min_q.popleft()\n                \n                start += 1\n            \n            ans = max(end-start+1, ans)\n        return ans\n\n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    \n    def longestSubarray2(self, nums: List[int], limit: int) -> int:\n        #[10,1,2,4,7,2]\n        #queue = [4, 7, 2, 8]\n        #min_queue = [2, 8]\n        #max_queue = [8]\n        #limit: 5\n        #ans: 4\n        q = deque()\n        min_q = deque()\n        max_q = deque()\n        ans = 0\n        for num in nums:\n            q.append(num)\n            while min_q and min_q[-1] > num:\n                min_q.pop()\n            min_q.append(num)\n            while max_q and max_q[-1] < num:\n                max_q.pop()\n            max_q.append(num)\n            while q and max_q[0] - min_q[0] > limit:\n                del_num = q.popleft()\n                if max_q[0] == del_num:\n                    max_q.popleft()\n                if min_q[0] == del_num:\n                    min_q.popleft()\n            ans = max(ans, len(q))\n        return ans\n\n    def longestSubarray2(self, nums: List[int], limit: int) -> int:\n        #[10,1,2,4,7,2]\n        #queue = [4, 7, 2, 8]\n        #min_queue = [2, 8]\n        #max_queue = [8]\n        #limit: 5\n        #ans: 4\n\n        min_q = deque()\n        max_q = deque()\n        start = 0\n        for num in nums:\n            while min_q and min_q[-1] > num:\n                min_q.pop()\n            min_q.append(num)\n\n            while max_q and max_q[-1] < num:\n                max_q.pop()\n            max_q.append(num)\n\n            if max_q[0] - min_q[0] > limit:\n                if max_q[0] == nums[start]:\n                    max_q.popleft()\n                if min_q[0] == nums[start]:\n                    min_q.popleft()\n                start += 1\n        return len(nums) - start\n\n        \n        \n\n    def longestSubarray2(self, nums: List[int], limit: int) -> int:\n        n = len(nums)\n        min_dp = [[0 for _ in range(n)] for _ in range(n)]\n        max_dp = [[0 for _ in range(n)] for _ in range(n)]\n        ans = 1 if 0 <= limit else 0\n        for i in range(n):\n            min_dp[i][i] = nums[i]\n            max_dp[i][i] = nums[i]\n        for k in range(2, n+1):\n            for i in range(n-k+1):\n                j = i + k - 1\n                min_dp[i][j] = min(min_dp[i][j-1], nums[j])\n                max_dp[i][j] = max(max_dp[i][j-1], nums[j])\n                if max_dp[i][j] - min_dp[i][j] <= limit:\n                    ans = k\n        return ans\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: 7268