<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Interactive on</title><link>https://h30306.github.io/blog/tags/interactive/</link><description>Recent content in Interactive 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>Tue, 23 Aug 2022 00:00:00 +0000</lastBuildDate><atom:link href="https://h30306.github.io/blog/tags/interactive/index.xml" rel="self" type="application/rss+xml"/><item><title>LeetCode 278: First Bad Version</title><link>https://h30306.github.io/blog/leetcode/leetcode-278/</link><pubDate>Tue, 23 Aug 2022 00:00:00 +0000</pubDate><author>hwork0511@gmail.com (Wei Yi Chung)</author><guid>https://h30306.github.io/blog/leetcode/leetcode-278/</guid><description>LeetCode 278 note: find the first version where isBadVersion is True with a lower-bound binary search, calling the API O(log n) times</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://h30306.github.io/blog/leetcode/leetcode-278/featured.png"/></item><item><title>LeetCode 374: Guess Number Higher or Lower</title><link>https://h30306.github.io/blog/leetcode/leetcode-374/</link><pubDate>Tue, 23 Aug 2022 00:00:00 +0000</pubDate><author>hwork0511@gmail.com (Wei Yi Chung)</author><guid>https://h30306.github.io/blog/leetcode/leetcode-374/</guid><description>LeetCode 374 note: adjust the range by guess&amp;rsquo;s result, where -1 means the guess is too high and 1 too low</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://h30306.github.io/blog/leetcode/leetcode-374/featured.png"/></item></channel></rss>