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 = "#TRY 8/19/2020 \nclass Solution:\n    def longestSubarray(self, nums: List[int], limit: int) -> int:\n        max_deque = collections.deque()\n        min_deque = collections.deque()\n        \n        start = 0\n        end = 0 \n        max_limit_subarray = 0\n        for end in range(len(nums)): \n            while min_deque and nums[end] < nums[min_deque[-1]]: \n                min_deque.pop()\n            min_deque.append(end)\n            \n            while max_deque and nums[end] > nums[max_deque[-1]]: \n                max_deque.pop()\n                \n            max_deque.append(end)\n            \n            # max_val = nums[max_deque[0]]\n            # min_val = nums[min_deque[0]]\n            # limit_break = abs(max_val - min_val)\n            while abs(nums[max_deque[0]] - nums[min_deque[0]]) > limit: #limit has been broken. \n#                 limit_break -= nums[start]\n                start += 1 #shrink the window.\n                if start > min_deque[0]: \n                    min_deque.popleft()\n                if start > max_deque[0]:\n                    max_deque.popleft()\n                \n             \n            \n            #Get the best window length so far.        \n            max_limit_subarray = max(max_limit_subarray, end - start + 1)\n            \n        return max_limit_subarray\n                \n            \n            \n            \n# class Solution:\n#     def longestSubarray(self, nums: List[int], limit: int) -> int:\n#         # sanity check\n#         if nums is None or len(nums) <= 1 or limit < 0:\n#             return 1\n        \n#         # sliding window approach in O(n) time\n#         max_len, l, r = 0, 0, 0\n        \n#         # notice that, the only absolute difference we need to check is the \n#         # maximum possible absolute difference since it ensures there are no\n#         # other absolute differences that can be bigger than @limit\n#         max_val, min_val = 0, 0\n        \n#         # dequeu method of keeping a local min and max over a sliding window in \n#         # amortized O(1) time \n#         # reference: https://www.nayuki.io/page/sliding-window-minimum-maximum-algorithm\n#         min_dq, max_dq = [], []\n        \n#         while r < len(nums):\n#             val = nums[r] \n            \n#             # update min_dq\n#             while len(min_dq) > 0 and val < min_dq[-1]:\n#                 min_dq.pop()\n#             min_dq.append(val)\n            \n#             # update max_dq\n#             while len(max_dq) > 0 and val > max_dq[-1]:\n#                 max_dq.pop()\n#             max_dq.append(val)\n\n#             max_val = max_dq[0]\n#             min_val = min_dq[0]\n            \n#             diff = abs(max_val - min_val)\n            \n#             # note that we do not have to worry about the left pointer passing the right one\n#             if diff > limit:\n#                 # recalculate min and max values of window by updating dequeues\n#                 check = nums[l]\n#                 if check == min_dq[0]:\n#                     min_dq.pop(0)\n#                 if check == max_dq[0]:\n#                     max_dq.pop(0)\n                \n#                 # shrink window\n#                 l += 1\n            \n#             # expand window\n#             max_len = max(max_len, r - l + 1)\n#             r += 1\n        \n#         return max_len  \n\n\n# class Solution:\n#     def longestSubarray(self, nums: List[int], limit: int) -> int:\n#         #int array nums\n#         #int limit \n#         #ret longest non-empty subarray s.t \n#         #the absolute diff betweeen any two elemetns of the subarray is <= limit \n        \n#         start = 0\n#         end = 0 \n        \n#         min_ele = float('inf')\n#         max_ele = float('-inf')\n#         sub_array = []\n        \n#         contig_sub = float('-inf')\n#         #currently start at zero but let's see if we can try to start at the end maybe? \n#         while end < len(nums):\n#             sub_array = nums[start:end + 1]\n#             limit_breaker = abs(max(sub_array) - min(sub_array))\n            \n#             while limit_breaker > limit: #You are too much :'( \n#                 tmp = start \n            \n#                 limit_breaker -= nums[tmp]\n#                 # start += 1 #This is too early because once we've subtracted we're using it \n#                 #This means that start wil lbe < 1 for contig sub potentially. \n                \n#             if limit_breaker <= limit: #You are okay. \n#                 contig_sub = max(contig_sub, end - start + 1)\n#             end += 1\n        \n#         return contig_sub\n\n# class Solution:\n#     def longestSubarray(self, nums: List[int], limit: int) -> int:\n#         #Queues to take the min and the max of our subarray so far.\n#         min_deque, max_deque = deque(), deque()\n#         l = r = 0\n#         ans = 0\n#         while r < len(nums):\n#             #Min_deque has the minimum value position and check if there are better ones \n#             while min_deque and nums[r] <= nums[min_deque[-1]]:\n#                 min_deque.pop()\n#             min_deque.append(r)\n            \n#             #Max_deque has the maximum value position and check if there are better ones \n#             while max_deque and nums[r] >= nums[max_deque[-1]]:\n#                 max_deque.pop()\n#             max_deque.append(r)\n            \n#             #Limit break the limit? \n#             #If it does then we can find the next one. \n#             while nums[max_deque[0]] - nums[min_deque[0]] > limit:\n#                 l += 1\n#                 #if the next position is > than our current one than we know it's no longer a part of the subarray.\n#                 if l > min_deque[0]:\n#                     min_deque.popleft()\n#                 if l > max_deque[0]:\n#                     max_deque.popleft()\n            \n#             ans = max(ans, r - l + 1)\n#             r += 1\n                \n#         return ans\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: 7454