Given an array of integers and a number N, find the length of the longest contiguous subarray such that the difference between any two elements in the subarray is less than N.

To find the longest contiguous subarray where the difference between any two elements is less than N, we can use a sliding window approach. The core idea is that the condition max(subarray) - min(subarray) < N must hold. We maintain a window using two pointers, left and right. As right expands the window, we need to efficiently track the maximum and minimum elements within the current window. This can be done using two monotonic deques: one storing indices in decreasing order of element values (for the maximum) and another storing indices in increasing order (for the minimum). When the condition nums[max_deque.front()] - nums[min_deque.front()] >= N is violated, we shrink the window from the left by advancing the left pointer and removing outdated indices from the deques. The maximum window size encountered is the answer.