DIY: Longest Subarray With Absolute Diff Less Than Equal to Limit
Problem statement
You are given an array of integers, nums, and an integer, limit. You have to return the size of the longest non-empty subarray such that the absolute difference between any two elements of this subarray is less than ...
Create a free account to view this lesson.
By signing up, you agree to Educative's Terms of Service and Privacy Policy