<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Monotonic on Rik Kisnah - Blog</title><link>https://www.rik-kisnah.ai/tags/monotonic/</link><description>Recent content in Monotonic 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/monotonic/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>Stacks</title><link>https://www.rik-kisnah.ai/teach/coding/stacks/</link><pubDate>Tue, 21 Feb 2017 09:00:00 -0800</pubDate><guid>https://www.rik-kisnah.ai/teach/coding/stacks/</guid><description>A pile of plates. You only ever touch the top one. That is enough to match brackets, undo edits, unwind nested things, and find the next bigger number for every item in one pass. Learn the three shapes and you have the whole family.</description></item></channel></rss>