<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Iterator on</title><link>https://h30306.github.io/blog/tags/iterator/</link><description>Recent content in Iterator on</description><generator>Hugo -- gohugo.io</generator><language>en</language><managingEditor>hwork0511@gmail.com (Wei Yi Chung)</managingEditor><webMaster>hwork0511@gmail.com (Wei Yi Chung)</webMaster><copyright>© 2026 Wei Yi Chung</copyright><lastBuildDate>Sat, 24 Oct 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://h30306.github.io/blog/tags/iterator/index.xml" rel="self" type="application/rss+xml"/><item><title>LeetCode 173: Binary Search Tree Iterator</title><link>https://h30306.github.io/blog/leetcode/leetcode-173/</link><pubDate>Sat, 24 Oct 2026 00:00:00 +0000</pubDate><author>hwork0511@gmail.com (Wei Yi Chung)</author><guid>https://h30306.github.io/blog/leetcode/leetcode-173/</guid><description>LeetCode 173 note: flattening to an array is simple but uses O(n) space; the follow-up keeps the left spine on a stack for amortized O(1) and O(h) space</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://h30306.github.io/blog/leetcode/leetcode-173/featured.png"/></item><item><title>Queue and Design Problems</title><link>https://h30306.github.io/blog/algorithm/queue-and-design/</link><pubDate>Tue, 20 Oct 2026 00:00:00 +0000</pubDate><author>hwork0511@gmail.com (Wei Yi Chung)</author><guid>https://h30306.github.io/blog/algorithm/queue-and-design/</guid><description>Circular queues, zigzag iterators, FIFO matching with cancellation, and the data structure combinations that design problems keep using</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://h30306.github.io/blog/algorithm/queue-and-design/featured.png"/></item><item><title>LeetCode 281: Zigzag Iterator</title><link>https://h30306.github.io/blog/leetcode/leetcode-281/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><author>hwork0511@gmail.com (Wei Yi Chung)</author><guid>https://h30306.github.io/blog/leetcode/leetcode-281/</guid><description>LeetCode 281 note: a queue of unfinished sources, take one value in turn and put the source back if anything remains; it generalizes to k sources</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://h30306.github.io/blog/leetcode/leetcode-281/featured.png"/></item></channel></rss>