Coding - Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit

Problem Statement

You are given an integer array nums and an integer limit. Return the length of the longest continuous subarray such that the absolute difference between the maximum and minimum element in the subarray is less than or equal to limit.

Examples

Example 1:

Input: nums = [8,2,4,7], limit = 4 Output: 2 Explanation: The longest subarray is [2, 4, 7] with maximum absolute difference of 5 - 2 = 3.

Example 2:

Input: nums = [10,1,2,4,7,2], limit = 5 Output: 4 Explanation: The longest subarray is [2, 4, 7, 2] with maximum absolute difference of 7 - 2 = 5.

Example 3:

Input: nums = [7,3,6,2], limit = 2 Output: 2

Constraints

• 1 <= nums.length <= 10^5
• 1 <= nums[i], limit <= 10^5

Hints

1. Use a sliding window approach to solve the problem.
2. Keep track of the minimum and maximum values within the window.
3. Adjust the window size to ensure the absolute difference is within the limit.