Leetcode 1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit

Find the length of the longest contiguous subarray whose maximum minus minimum is ≤ limit; the key challenge is maintaining the window's current min and max efficiently (commonly solved with a sliding window and monotonic deques for O(n) time).