Window Sliding Technique

index.js

// https://www.geeksforgeeks.org/longest-subarray-sum-elements-atmost-k/

function maxLength(arr, k) {
  let sum = 0;
  let cnt = 0;
  let maxLength = 0;
  const arrL = arr.length;
  for (let i = 0; i < arrL; i++) {
    sum += arr[i];
    if (k >= sum) {
      cnt += 1;
    } else if (sum != 0) {
      // deduct the first el
      sum -= arr[i - cnt];
    }
    maxLength = Math.max(cnt, maxLength);
  }
  return maxLength;
}