CodeBaobab
LECTURE 12 OF 25

Sliding Window

A window that only ever grows on the right and shrinks on the left — each edge crosses every position at most once, so the whole scan is O(n).

Builds on
Best read after 2. Arrays, 10. Hash Tables and Sets — you can still read ahead, but some of this may lean on ideas covered there.

Loading course…