Longest Continuous Subarray With Absolute

lcpy gen -n 1438   # by problem number
lcpy gen -s longest_continuous_subarray_with_absolute_diff_less_than_or_equal_to_limit   # by problem name

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.

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.

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

from collections import deque


class Solution:
    # Time: O(n) each index enters and leaves both deques at most once
    # Space: O(n) for the two monotonic deques
    def longest_subarray(self, nums: list[int], limit: int) -> int:
        min_deque: deque[int] = deque()
        max_deque: deque[int] = deque()
        left = 0
        best = 0
        for right, value in enumerate(nums):
            while min_deque and min_deque[-1] > value:
                min_deque.pop()
            min_deque.append(value)
            while max_deque and max_deque[-1] < value:
                max_deque.pop()
            max_deque.append(value)
            while max_deque[0] - min_deque[0] > limit:
                if max_deque[0] == nums[left]:
                    max_deque.popleft()
                if min_deque[0] == nums[left]:
                    min_deque.popleft()
                left += 1
            best = max(best, right - left + 1)
        return best