<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Biweekly-Contest on</title><link>https://h30306.github.io/blog/zh-tw/tags/biweekly-contest/</link><description>Recent content in Biweekly-Contest on</description><generator>Hugo -- gohugo.io</generator><language>zh-tw</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, 26 Apr 2025 00:00:00 +0000</lastBuildDate><atom:link href="https://h30306.github.io/blog/zh-tw/tags/biweekly-contest/index.xml" rel="self" type="application/rss+xml"/><item><title>LeetCode 3527: Find the Most Common Response</title><link>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-3527/</link><pubDate>Sat, 26 Apr 2025 00:00:00 +0000</pubDate><author>hwork0511@gmail.com (Wei Yi Chung)</author><guid>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-3527/</guid><description>LeetCode 解題紀錄</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://h30306.github.io/blog/leetcode/leetcode-3527/featured.png"/></item><item><title>LeetCode 3528: Unit Conversion I</title><link>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-3528/</link><pubDate>Sat, 26 Apr 2025 00:00:00 +0000</pubDate><author>hwork0511@gmail.com (Wei Yi Chung)</author><guid>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-3528/</guid><description>LeetCode 解題紀錄</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://h30306.github.io/blog/leetcode/leetcode-3528/featured.png"/></item><item><title>LeetCode 3512: Minimum Operations to Make Array Sum Divisible by K</title><link>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-3512/</link><pubDate>Sat, 12 Apr 2025 00:00:00 +0000</pubDate><author>hwork0511@gmail.com (Wei Yi Chung)</author><guid>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-3512/</guid><description>LeetCode 解題紀錄</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://h30306.github.io/blog/leetcode/leetcode-3512/featured.png"/></item><item><title>LeetCode 3513: Number of Unique XOR Triplets I</title><link>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-3513/</link><pubDate>Sat, 12 Apr 2025 00:00:00 +0000</pubDate><author>hwork0511@gmail.com (Wei Yi Chung)</author><guid>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-3513/</guid><description>LeetCode 解題紀錄</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://h30306.github.io/blog/leetcode/leetcode-3513/featured.png"/></item></channel></rss>