2. Sliding Window

Medium

Topics

Helpful tools to learn & understand

Visualize LogicActive Simulator

Watch key transitions, pointers, and variables update step-by-step.

Open

Check Solutions

Read clean, documented implementations across multiple patterns.

View Code

Thinkpad (Draw & Note)

Sketch diagrams on an infinite canvas and draft notes directly inline.

Draw

Example 1:

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

Output: 24

Explanation: The subarray [3, 1, 0, 20] has the maximum sum of 24.

Example 2:

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

Output: 9

Explanation: The subarray [4, 5] has the maximum sum of 9.

Example 3:

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

Output: -6

Explanation: The subarray [-1, -2, -3] has the maximum sum of -6.

Example 4:

Input: arr = [1, 2, 3, -5, 2, 1], k = 3

Output: 6

Explanation: The subarray [1, 2, 3] has the maximum sum of 6.

Example 5:

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

Output: 9

Explanation: The subarray [5, 1, 3] has the maximum sum of 9.

Constraints:

•
•

Time Complexity

O(n)

Space Complexity

O(k)