<p>Given an array of integers <code>nums</code> and an integer <code>limit</code>, return the size of the longest <strong>non-empty</strong> subarray such that the absolute difference between any two elements of this subarray is less than or equal to <code>limit</code><em>.</em></p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> nums = [8,2,4,7], limit = 4
<strong>Output:</strong> 2 
<strong>Explanation:</strong> All subarrays are: 
[8] with maximum absolute diff |8-8| = 0 &lt;= 4.
[8,2] with maximum absolute diff |8-2| = 6 &gt; 4. 
[8,2,4] with maximum absolute diff |8-2| = 6 &gt; 4.
[8,2,4,7] with maximum absolute diff |8-2| = 6 &gt; 4.
[2] with maximum absolute diff |2-2| = 0 &lt;= 4.
[2,4] with maximum absolute diff |2-4| = 2 &lt;= 4.
[2,4,7] with maximum absolute diff |2-7| = 5 &gt; 4.
[4] with maximum absolute diff |4-4| = 0 &lt;= 4.
[4,7] with maximum absolute diff |4-7| = 3 &lt;= 4.
[7] with maximum absolute diff |7-7| = 0 &lt;= 4. 
Therefore, the size of the longest subarray is 2.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> nums = [10,1,2,4,7,2], limit = 5
<strong>Output:</strong> 4 
<strong>Explanation:</strong> The subarray [2,4,7,2] is the longest since the maximum absolute diff is |2-7| = 5 &lt;= 5.
</pre>

<p><strong class="example">Example 3:</strong></p>

<pre>
<strong>Input:</strong> nums = [4,2,2,2,4,4,2,2], limit = 0
<strong>Output:</strong> 3
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= nums.length &lt;= 10<sup>5</sup></code></li>
	<li><code>1 &lt;= nums[i] &lt;= 10<sup>9</sup></code></li>
	<li><code>0 &lt;= limit &lt;= 10<sup>9</sup></code></li>
</ul>

import sortedcontainers
class Solution:
    def longestSubarray(self, nums: List[int], limit: int) -> int:
        return self._sol2(nums, limit)

    def _sol2(self, nums: List[int], limit: int) -> int:
        max_deque = collections.deque()
        min_deque = collections.deque()
        window_left = 0
        longest = 0
        for i, val in enumerate(nums):
            while max_deque and max_deque[-1][0] < val:
                max_deque.pop()
            max_deque.append((val, i))
            while min_deque and min_deque[-1][0] > val:
                min_deque.pop()
            min_deque.append((val, i))
            while max_deque[0][0] - min_deque[0][0] > limit:
                if max_deque[0][1] > min_deque[0][1]:
                    _, removed_i = min_deque.popleft()
                    window_left = removed_i + 1
                else:
                    _, removed_i = max_deque.popleft()
                    window_left = removed_i + 1
            longest = max(longest, i - window_left)
        return longest + 1

    # Perf: 8.9% 1185 ms, 37.1% 27.9 MB. Way higher than the curves, 2 main are ~ 525 to 597 and 597 to 683.
    def _sol1(self, nums: List[int], limit: int) -> int:
        longest = 0
        window_vals = sortedcontainers.SortedList([nums[0]])
        window_left = 0
        for i in range(1, len(nums)):
            window_vals.add(nums[i])
            while window_vals[-1] - window_vals[0] > limit:
                window_vals.remove(nums[window_left])
                window_left += 1
            longest = max(longest, i - window_left)
        return longest + 1
        
33370