Sliding Window/Maximum Sum of Subarrays of Size KEasy

This practice workspace is built for desktop. Open it on a larger screen to start solving.

Maximum Sum of Subarrays of Size K

Sliding Window·Easy

Given an integer array nums and a positive integer k, return the maximum sum of any contiguous subarray of length exactly k.

Use a fixed-size sliding window: compute the first window's sum, then slide one position at a time by adding the entering element and subtracting the leaving one.

Examples

Input: nums = [2,1,5,1,3,2], k = 3

Output: 9

Window `[5,1,3]` sums to 9, which is the largest among windows of size 3.

Input: nums = [2,3,4,1,5], k = 2

Output: 7

Window `[3,4]` sums to 7.

Constraints

1 <= k <= nums.length <= 10^5
-10^4 <= nums[i] <= 10^4

00:00Preview Mode (Read Only)

Loading editor…

Tests

Preview Mode

This is a read-only preview of DSAMind's AI coaching. Sign up to get custom feedback on your own solution.

Passed32 ms

First attempt — retry to track metric movement here.

Your approach

Pattern:Sliding Window
Time:O(N)
Space:O(1)

Complete approach — pattern and complexity both named.

Coach

What you got right

You correctly matched the sorted input requirement and implemented a linear-time scan using two pointers.

Where it diverged

No divergence detected. The code correctly aligns with the stated approach.

Next attempt: focus on

Try solving related sliding window problems to build familiarity with two-pointer variants.

Signals

No signals fired — clean run, you stayed in flow.