Minimum covering window

Kestrel Stream sells sponsored blocks: the shortest stretch of a channel's schedule that plays every sponsored track as often as required. The first attempt extends from every start and needs about 2.8 trillion reads a night. One window that grows until it covers and shrinks while it covers, with a missing counter, finds the earliest shortest block in O(n + m).