Best Window Sum
Look at every stretch of k consecutive nodes and add up its values. Return the largest such sum. The list always has at least k nodes. The list is passed in as head.
Linked lists appear in the tests as the list of their values, like [1,2,3]. Each node is a ListNode with .val and .next; the class is already defined for you.
Example 1
head [1,5,2,8,1]
k 2
returns 10
The best pair is 2 + 8 = 10.
Example 2
head [-4,-2,-9]
k 1
returns -2
With k = 1 it is the largest value.
Constraints
1 <= k <= number of nodes <= 100-100 <= Node.val <= 100
Write it in your browser, against the clock. The model solution, stepped through line by line, comes after.