pythonOff-by-oneHard

Algorithm missing the final window

Time: 0:00

What it should do

max_window_sum(nums, k) should return the largest sum of any k consecutive numbers. max_window_sum([1,2,3,10], 2) is 13.

What goes wrong

max_window_sum([1,2,3,10], 2) returns 5 instead of 13 — the window containing the largest value is never examined.

Hints

This is an off-by-one errors bug

The loop that runs one time too many, the slice that drops the last item, the index that starts in the wrong place.