GV

GeezerVison

The World Wide Web, restored to 800 pixels of glory.

Home|About|Gaming cabinet|Archives|How it works|Starter sites

On this site

  • Sign in
  • ActionsCI/CD and automation
  • CodespacesCloud development environments
  • All Features
  • Documentation
  • Training
  • Certifications
  • Build with Copilot
  • Customize Copilot
  • Integrations
  • Trending repos
  • GitHub Sponsors
  • Developer articles
  • Enterprises

This view

  • Original page
  • New address

GeezerVison is showing github.com — JavaScript/Sliding-Windows/MaxSumSubarrayFixed.js at master · TheAlgorithms/JavaScript

Expand file tree

/

MaxSumSubarrayFixed.js

Copy path
More file actions
More file actions

Latest commit

 

History

History
History
26 lines (26 loc) · 777 Bytes
/

MaxSumSubarrayFixed.js

Copy path

File metadata and controls

26 lines (26 loc) · 777 Bytes
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
/**
* Function to find the maximum sum of a subarray of fixed size k.
*
* @param {number[]} arr - The input array of numbers.
* @param {number} k - The fixed size of the subarray.
* @returns {number} - The maximum sum of any subarray of size k.
* @throws {RangeError} - If k is larger than the array length or less than 1.
*/
export function maxSumSubarrayFixed(arr, k) {
if (k > arr.length || k < 1) {
throw new RangeError(
'Subarray size k must be between 1 and the length of the array'
)
}
let maxSum = 0
let windowSum = 0
for (let i = 0; i < k; i++) {
windowSum += arr[i]
}
maxSum = windowSum
for (let i = k; i < arr.length; i++) {
windowSum += arr[i] - arr[i - k]
maxSum = Math.max(maxSum, windowSum)
}
return maxSum
}
You are visitor 01402503 — GeezerVison does not store the pages you look up.
Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required.