Episode 5 Sliding Window

What you'll learn

• What a window is, and fixed vs variable windows
• The fixed and variable window templates, line by line
• Why each number entering once and leaving once makes it O(n)
• Fixed windows: a running sum and a running count
• Variable windows: the longest that obeys a rule, with a sum or a set
• The shortest window: shrink while it's still valid
• At most k kinds with a map, and counting every valid window
• Exactly k = at most k − at most k−1
• The window maximum with a monotonic deque

Chapters

1. 0:00Intro
2. 0:17What's a window?
3. 0:44Fixed vs variable windows
4. 1:11The fixed window template
5. 1:57The variable window template
6. 2:45Why it's O(n)
7. 3:12What the window remembers
8. 3:48Nine kinds of window
9. 4:30Type 1 · Best sum of k in a row
10. 10:21Type 2 · Most vowels in k letters
11. 16:13Type 3 · Longest run with sum ≤ k
12. 21:33Type 4 · Longest run with no repeated number
13. 26:55Type 5 · Shortest run with sum ≥ target
14. 32:30Type 6 · Longest run with at most 2 different numbers
15. 38:37Type 7 · How many runs have sum ≤ k?
16. 44:35Type 8 · Runs with exactly 2 odd numbers
17. 50:22Type 9 · Max of every window of size k
18. 56:09Spot the pattern
19. 56:41Quiz: which window?
20. 57:20Recap