Maximum window sum
Given a stream of integers and a window size `k`, return the maximum sum of any contiguous window of exactly `k` elements. If `k` is not a positive integer or is larger than the stream length, return `-1`. The stream may contain negatives.
Implement
max_window_sum(stream: list[int], k: int) → intExamples
in
[[1,2,3,4,5],2]out9What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 15 min
solution.py
InputExpectedGot
[[1,2,3,4,5],2]9not run yetsample