<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>Deque on Jeanphilo Blog</title><link>https://jeanphilogong.github.io/jeanblog/tags/deque/</link><description>Recent content in Deque on Jeanphilo Blog</description><generator>Hugo -- 0.168.0</generator><language>en-us</language><lastBuildDate>Mon, 19 Jan 2026 17:46:14 +0800</lastBuildDate><atom:link href="https://jeanphilogong.github.io/jeanblog/tags/deque/index.xml" rel="self" type="application/rss+xml"/><item><title>LeetCode 239: Sliding Window Maximum</title><link>https://jeanphilogong.github.io/jeanblog/alg/leetcode/239-sliding-window-maximum/</link><pubDate>Mon, 19 Jan 2026 17:46:14 +0800</pubDate><guid>https://jeanphilogong.github.io/jeanblog/alg/leetcode/239-sliding-window-maximum/</guid><description>Solve LeetCode 239 by defining complete windows, building a correct scan, and deriving an O(n) index-deque solution.</description></item></channel></rss>