<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Sliding Window on Rik Kisnah - Blog</title><link>https://www.rik-kisnah.ai/tags/sliding-window/</link><description>Recent content in Sliding Window on Rik Kisnah - Blog</description><generator>Hugo</generator><language>en</language><lastBuildDate>Tue, 13 Feb 2024 09:00:00 -0800</lastBuildDate><atom:link href="https://www.rik-kisnah.ai/tags/sliding-window/feed.xml" rel="self" type="application/rss+xml"/><item><title>Sliding Window Maximum</title><link>https://www.rik-kisnah.ai/teach/coding/sliding-window-maximum/</link><pubDate>Tue, 13 Feb 2024 09:00:00 -0800</pubDate><guid>https://www.rik-kisnah.ai/teach/coding/sliding-window-maximum/</guid><description>A window of size k slides along an array. For each position, what is the biggest number inside? A queue that throws away anything smaller than the newcomer answers it in one pass.</description></item><item><title>Sliding Window, Fixed Length</title><link>https://www.rik-kisnah.ai/teach/coding/sliding-window-fixed-length/</link><pubDate>Tue, 03 Oct 2017 09:00:00 -0700</pubDate><guid>https://www.rik-kisnah.ai/teach/coding/sliding-window-fixed-length/</guid><description>Find the best run of exactly k items in a row. Do not re-add the window every time it moves. Add the one coming in, subtract the one going out. One pass, and the same trick works for sums, counts and letters.</description></item></channel></rss>