SlidingWindow MinSumSubArray

SlidingWindow.js

const nums = [3, 5, 2, 1, 7]


const getMinSum = (nums, k) => {
  let min = Number.MAX_VALUE
  let curr = 0
  let start = 0
  let end = 0

  for (let windowEnd = 0; windowEnd < nums.length; windowEnd++) {
    curr += nums[windowEnd]

    if (windowEnd >= k - 1) {
      if (curr < min) {
        min = curr
        start = windowEnd - k + 1
        end = windowEnd
      }
      curr -= nums[windowEnd - k + 1]
    }
  }
  return { min, start, end, subarray: nums.slice(start, end + 1) }
}


console.log(getMinSum(nums, 2));

//{ min: 3, start: 2, end: 3, subarray: [ 2, 1 ] }

//or another version

const maxSubArr = (nums = [], K=2) => {
  let max = -Infinity
  let left = 0
  let curr=0
  for (let i = 0; i < nums.length; i++){
    curr += nums[i]
    
    if (i - left + 1 === K) {
      max = Math.max(max, curr)
      curr -= nums[left++]
    }
  }
  return max
}

const nums = [3, 5, 2, 1, 7]


console.log(maxSubArr(nums)); //8