dsa10 min read
Sliding Window Maximum (LC 239) — Monotonic Deque Deep Dive
Find the maximum in every sliding window of size k in O(n) using a monotonic decreasing deque of indices — the classic hard problem that separates senior engineers from the rest.
Read →