Longest Subarray with Bounded Difference | Dataford Interview Questions

Find the length of the longest continuous subarray where the difference between its largest and smallest elements is less than K.

Asked in the DSA / BPS stage. Confirmed by OP ("yeah 2nd one").

Contract

Implement longest_subarray(nums, k). nums is a non-empty list of integers and k is a positive integer. Return an integer length. The condition is strict: max(window) - min(window) < k.

Constraints

1 <= len(nums) <= 100000
-1000000000 <= nums[i] <= 1000000000
1 <= k <= 2000000001

Function Signature

def longest_subarray(nums, k):

Your question is Longest Subarray with Bounded Difference. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem