Maximum Sum Subarray of Size K | CodeForge AI

Maximum Sum Subarray of Size KEasy

Sign in to solve

Maximum Sum Subarray of Size K

EasySliding Window

Given an array of integers arr and an integer k, find the maximum sum of a subarray of size k.

Input:

The first line contains the size of the array n.
The second line contains n space-separated integers representing the array arr.
The third line contains an integer k.

Output:

The maximum sum of a subarray of size k.

Example:

Input: 5 1 2 3 4 5 3
Output: 12

Example 1

Input: 5 1 2 3 4 5 3

Output: 12

The subarray [3, 4, 5] has the maximum sum of 12.

Constraints

1 <= n <= 10^5
1 <= k <= n
-10^5 <= arr[i] <= 10^5

Hints

arraysliding window

Sign in to run code

Run your code to see test results here.

Maximum Sum Subarray of Size K

EasySliding Window

Given an array of integers arr and an integer k, find the maximum sum of a subarray of size k.

Input:

The first line contains the size of the array n.
The second line contains n space-separated integers representing the array arr.
The third line contains an integer k.

Output:

The maximum sum of a subarray of size k.

Example:

Input: 5 1 2 3 4 5 3
Output: 12

Example 1

Input: 5 1 2 3 4 5 3

Output: 12

The subarray [3, 4, 5] has the maximum sum of 12.

Constraints

1 <= n <= 10^5
1 <= k <= n
-10^5 <= arr[i] <= 10^5

Hints

arraysliding window