Maximum Sum Subarray of Size K

Given an integer array `arr` and an integer `k`, find the **maximum sum** of any contiguous subarray of size `k`. Use a sliding window of fixed length `k` to compute each subarray sum efficiently.

Input Format

arr = array of integers, k = subarray size

Output Format

integer (maximum subarray sum of size k)

Constraints

  • 1 <= k <= arr.length <= 10^5; -10^4 <= arr[i] <= 10^4

Examples

Example 1:

Input:

arr = [1,4,2,10,23,3,1,0,20]
k = 4

Output:

39

Example 2:

Input:

arr = [2,3,4]
k = 2

Output:

7
Loading...
Maximum Sum Subarray of Size K - Sliding Window