Practice45 min
Practice: Counted Windows & Deques
Frequency-matched windows, the need-vs-have minimum window, and the deque-powered maximum.
The heavyweight set: a fixed window compared by letter counts, the canonical shortest-window problem with need-vs-have bookkeeping, and Sliding Window Maximum — where the monotonic deque replaces a heap and earns its O(n).