Longest Contiguous Subarray With Absolute Diff Bounded by a Limit
An array ‘B’ is a subarray of an array ‘A’ if ‘B’ that can be obtained by deletion of, several elements(possibly none) from the start of ‘A’ and several elements(possibly none) from the end of ‘A’.
The first line contains a single integer ‘T’ denoting the number of test cases. Then the 'T' test cases follow. The first line of each test case contains two integers separated by single space ‘N’ and 'LIMIT' denoting the number of elements in the array/list. The second line of each test case contains ‘N’ single space-separated integers denoting the elements of the array/list.
For each test case, print a single line that contains an integer that denotes the length of the longest contiguous subarray with absolute difference bounded by the 'LIMIT'.
You do not need to print anything, it has already been taken care of. Just implement the given function.
1 <= 'T' <= 50 1 <= 'N' <= 10^4 0 <= 'ARR[i]' <= 10^5 0 <= 'LIMIT' <= 10^5 Where 'ARR[i]' denotes the ith elements of the given array/list. Time Limit: 1 sec
Longest Subarray With Zero Sum
Merge Two Sorted Arrays Without Extra Space
Ninja And The Strictly Increasing Array
Negative To The End