How to use the Sliding Window Approach In Javascript

Using the Brute Force Approach

In this approach, the sliding window technique is used to find the maximum subarray length whose sum doesn’t exceed a given value k. It iterates through the array, adjusting the window boundaries to maintain the sum within k. Finally, it returns the maximum subarray length found.

Example: The example uses a sliding window technique to find the maximum subarray length with a sum not exceeding a given value.

JavaScript

function maxSubarrayLengthSlidingWindow(arr, k) {
    let maxLength = 0;
    let sum = 0;
    let start = 0;

    for (let end = 0; end < arr.length; end++) {
        sum += arr[end];
        while (sum > k) {
            sum -= arr[start];
            start++;
        }

        maxLength = Math.max(maxLength, end - start + 1);
    }

    return maxLength;
}
const array3 = [1, 2, 3, 4, 5];
const k3 = 11;
console.log(maxSubarrayLengthSlidingWindow(array3, k3));
const array4 = [3, 1, 2, 1];
const k4 = 4;
console.log(maxSubarrayLengthSlidingWindow(array4, k4));

Output

4
3

Time Complexity: O(n)

Space Complexity: O(1)

Max Length of Subarray with Given Sum Limit in JavaScript Array

Given an array, our task is to find the maximum length of a subarray whose sum does not exceed a given value. We can use different approaches like the Brute Force Approach and the Sliding Window Approach to find the maximum length of a subarray.

Below are the approaches to find the maximum length of a subarray with a sum not exceeding a given value:

Table of Content