Here is an example.

Input Array: [2, 6, 9, 2, 1, 8, 5, 6, 3]

num: 3

//Let’s define two variables tracking sums of the consequent subset and the maximum sum compared to the temporary sum.

function maxSumArr(arr, num) {
    let maxSum = 0;
    let tempSum = 0;
}

//2. If the length of an array is less than the num, we should return null before start looping through the array.

function maxSumArr(arr, num) {
    let maxSum = 0;
    let tempSum = 0;
    if(arr.length < num) return null;
}

//3. Start looping through an array from index 0 to the size of num, and add every element to the tempSum

function maxSumArr(arr, num) {
    let maxSum = 0;
    let tempSum = 0;
    if(arr.length < num) return null;
    for(let i = 0; i < num; i++) {
       tempSum += arr[i];
    }
}

//4. Set the tempSum to the maxSum variable, and loop through the array again starting from the num to get a new tempSum. The new tempSum is achieved by sliding window of the array so we can subtract the previous element of the new subset and add the new element

function maxSumArr(arr, num) {
    let maxSum = 0;
    let tempSum = 0;
    if(arr.length < num) return null;
    for(let i = 0; i < num; i++) {
       tempSum += arr[i];
    }
    tempSum = maxSum;
    for(let i = num; i < arr.length; i++) {
       tempSum = tempSum - arr[i - num] + arr[i];
    }
}

//5. Now, it’s time to compare between maxSum and tempSum and set bigger sum as maxSum, in which we will return at last.

function maxSumArr(arr, num) {
    let maxSum = 0;
    let tempSum = 0;
    if(arr.length < num) return null;
    for(let i = 0; i < num; i++) {
       tempSum += arr[i];
    }
    tempSum = maxSum;
    for(let i = num; i < arr.length; i++) {
       tempSum = tempSum - arr[i - num] + arr[i];
       maxSum = Math.max(tempSum, maxSum);
       }      
       return maxSum;
}
//We got our sum of the maximal subarray! Using the Sliding Window algorithms, it reduced the operating time to O(n). Great job.

Popularity 10/10 Helpfulness 2/10 Language javascript

Source: Grepper

Tags: algorithm algo

Link to this answer
Share Copy Link

Contributed on May 07 2022

Ramsey

0 Answers Avg Quality 2/10

sliding window algorithm javascript

Comment

function findMaxSum(arr, windowSize) {
  if (arr.length < windowSize) {
    return "Invalid input";
  }

  let maxSum = 0;
  for (let i = 0; i < windowSize; i++) {
    maxSum += arr[i];
  }

  let windowSum = maxSum;
  for (let i = windowSize; i < arr.length; i++) {
    windowSum += arr[i] - arr[i - windowSize];
    maxSum = Math.max(maxSum, windowSum);
  }

  return maxSum;
}

const numbers = [1, 4, 2, 10, 2, 3, 1, 0, 20];
const windowSize = 3;

const maxSum = findMaxSum(numbers, windowSize);
console.log("Maximum sum:", maxSum);

Popularity 6/10 Helpfulness 2/10 Language javascript

Source: Grepper

Link to this answer
Share Copy Link

Contributed on Sep 12 2023

YOU.com

0 Answers Avg Quality 2/10

sliding window javascript

Comment

//Find the minimum sum of n consecutive elements in array
//i.e minSum of 3 consecutive elements in [1,2,3,4,5,6] is 1+2+3 = 6

const slidingWindow = (arr, n) => {
  let minSum,sum = 0;
  for (let i = 0; i < n; i++) {
    sum += arr[i];
  }
 minSum=sum;

  for (let j = n; j < arr.length; j++) {
    sum = sum - arr[j - n] + arr[j];
    if (sum < minSum) minSum = sum;
  }

  return minSum;
};

Popularity 8/10 Helpfulness 2/10 Language javascript

Source: Grepper

Tags: javascript j

Link to this answer
Share Copy Link

Contributed on Jul 09 2023

Farooq Ali

0 Answers Avg Quality 2/10

array sliding window technique

Contents

More Related Answers

array sliding window technique

Closely Related Answers

sliding window algorithm javascript

sliding window algorithm javascript

sliding window javascript

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.