← Sliding Window

Micro-Drill #101 — Sliding window max sum (k)

Sliding Window Target: 10s

Fixed-size sliding window computes running aggregates in O(n). Core optimization pattern.

mx = cur = sum(a[:k])
for i in range(k, len(a)):
    cur += a[i] - a[i-k]
    mx = max(mx, cur)

Type it from memory. Go.

Practice Problems

Related Coding Drills

← Micro #100 Micro #102 →