chapterStream.tex

\chapter{Stream}
\section{Sliding Window}
\runinhead{Sliding Window Maximum.} Given an array $nums$, Find the list of maximum in the sliding window of size $k$ which is moving from the very left of the array to the very right. $\rightarrow$ double-ended queue.

Invariant: the queue is storing the non-decreasing-ordered elements of current window.

\runinhead{Sliding Window Median.} Find the list of median in the sliding window. $\rightarrow$ Dual heap with lazy deletion - section \ref{dh_lazy_del}.