<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Weekly-Contest on</title><link>https://h30306.github.io/blog/tags/weekly-contest/</link><description>Recent content in Weekly-Contest 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>Sun, 20 Apr 2025 00:00:00 +0000</lastBuildDate><atom:link href="https://h30306.github.io/blog/tags/weekly-contest/index.xml" rel="self" type="application/rss+xml"/><item><title>LeetCode 3522: Calculate Score After Performing Instructions</title><link>https://h30306.github.io/blog/leetcode/leetcode-3522/</link><pubDate>Sun, 20 Apr 2025 00:00:00 +0000</pubDate><author>hwork0511@gmail.com (Wei Yi Chung)</author><guid>https://h30306.github.io/blog/leetcode/leetcode-3522/</guid><description>LeetCode Problem Solving</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://h30306.github.io/blog/leetcode/leetcode-3522/featured.png"/></item><item><title>LeetCode 3523: Make Array Non-decreasing</title><link>https://h30306.github.io/blog/leetcode/leetcode-3523/</link><pubDate>Sun, 20 Apr 2025 00:00:00 +0000</pubDate><author>hwork0511@gmail.com (Wei Yi Chung)</author><guid>https://h30306.github.io/blog/leetcode/leetcode-3523/</guid><description>LeetCode Problem Solving</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://h30306.github.io/blog/leetcode/leetcode-3523/featured.png"/></item><item><title>LeetCode 3516: Find Closest Person</title><link>https://h30306.github.io/blog/leetcode/leetcode-3516/</link><pubDate>Sun, 13 Apr 2025 00:00:00 +0000</pubDate><author>hwork0511@gmail.com (Wei Yi Chung)</author><guid>https://h30306.github.io/blog/leetcode/leetcode-3516/</guid><description>LeetCode Problem Solving</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://h30306.github.io/blog/leetcode/leetcode-3516/featured.png"/></item><item><title>LeetCode 3517: Smallest Palindromic Rearrangement I</title><link>https://h30306.github.io/blog/leetcode/leetcode-3517/</link><pubDate>Sun, 13 Apr 2025 00:00:00 +0000</pubDate><author>hwork0511@gmail.com (Wei Yi Chung)</author><guid>https://h30306.github.io/blog/leetcode/leetcode-3517/</guid><description>LeetCode Problem Solving</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://h30306.github.io/blog/leetcode/leetcode-3517/featured.png"/></item></channel></rss>