<?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>Design on Jeanphilo Blog</title><link>https://shio-chan-dev.github.io/jeanblog/tags/design/</link><description>Recent content in Design on Jeanphilo Blog</description><generator>Hugo -- 0.165.0</generator><language>en-us</language><lastBuildDate>Fri, 21 Aug 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://shio-chan-dev.github.io/jeanblog/tags/design/index.xml" rel="self" type="application/rss+xml"/><item><title>LeetCode 155: Min Stack, Keeping the Minimum in Sync With Stack State</title><link>https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/155-min-stack/</link><pubDate>Fri, 21 Aug 2026 00:00:00 +0000</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/155-min-stack/</guid><description>Start from restoring the previous minimum after pop, build a correct scan baseline, and derive an O(1) Min Stack with synchronized prefix minima.</description></item></channel></rss>