Pointer Manipulation Target: 10s
Fixed-window sliding avoids re-summing by adding the new element and removing the old one.
window = sum(a[:k])
best = window
for i in range(k, len(a)):
window += a[i] - a[i - k]
best = max(best, window)Type it from memory. Go.