Longest Subarray With Absolute Difference at Most Limit
Medium
Monotonic Deque
Print the length of the longest contiguous subarray in which the absolute difference between any two elements is at most limit.
Constraints
1 <= n <= 10^5 1 <= nums[i] <= 10^9 0 <= limit <= 10^9
Discussion
No discussions yet.
Shalyam Support
Hi! Ask us anything — we'll reply on WhatsApp or Telegram within 24 hours.