Back to course home

0% completed

# Solution: Maximum Sum Subarray of Size K

## Problem Statement

Given an array of positive numbers and a positive number 'k,' find the **maximum sum of any contiguous subarray of size 'k'**.

**Example 1:**

```
Input: arr = [2, 1, 5, 1, 3, 2], k=3
Output: 9
Explanation: Subarray with maximum sum is [5, 1, 3].
```

**Example 2:**

```
Input: arr = [2, 3, 4, 1, 5], k=2
Output: 7
Explanation: Subarray with maximum sum is [3, 4].
```

## Solution

To solve this problem, we will use a brute force approach. The brute force method involves examining every possible subarray of size `k`

and calculating their sums

.....

.....

.....

Like the course? Get enrolled and start learning!