Max Consecutive Ones III - Problem Statement

Find longest subarray of 1s after flipping at most $k$ zeros. Classic two-pointer / sliding window. Not directly monotonic queue, but related.

The window expands right, contracts left when zeros exceed $k$. Connection: monotonic queue generalizes sliding window for min/max queries. Here we track zero count, not min/max. The principle is the same: maintain a valid window by removing expired or invalid elements from the left.