Sliding Window Max Subarray | Dataford Interview Questions

Wise. Energy analyzes consecutive energy readings to identify the highest-consumption period of a fixed duration. Given an integer array and a window size k, return the maximum sum of any contiguous subarray containing exactly k elements.

Formal Specification

Implement max_window_sum(nums, k).

Input: nums, a non-empty list of integers representing energy readings, and k, an integer window size.
Output: An integer equal to the largest sum among all contiguous subarrays of length k.
Assume 1 <= k <= len(nums).

The window must contain exactly k consecutive readings. Do not sort or rearrange the input.

Constraints

1 <= len(nums) <= 10^5
1 <= k <= len(nums)
-10^9 <= nums[i] <= 10^9
The result fits within a signed 64-bit integer.

Function Signature

def max_window_sum(nums, k):

Your question is Sliding Window Max Subarray. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem