<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Grid-Dp on</title><link>https://h30306.github.io/blog/tags/grid-dp/</link><description>Recent content in Grid-Dp 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, 13 Sep 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://h30306.github.io/blog/tags/grid-dp/index.xml" rel="self" type="application/rss+xml"/><item><title>Grid DP</title><link>https://h30306.github.io/blog/algorithm/grid-dp/</link><pubDate>Sun, 13 Sep 2026 00:00:00 +0000</pubDate><author>hwork0511@gmail.com (Wei Yi Chung)</author><guid>https://h30306.github.io/blog/algorithm/grid-dp/</guid><description>Counting, cost optimization, reverse resource DP, and local geometry</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://h30306.github.io/blog/algorithm/grid-dp/featured.png"/></item><item><title>LeetCode 1289: Minimum Falling Path Sum II</title><link>https://h30306.github.io/blog/leetcode/leetcode-1289/</link><pubDate>Sun, 05 Jul 2026 00:00:00 +0000</pubDate><author>hwork0511@gmail.com (Wei Yi Chung)</author><guid>https://h30306.github.io/blog/leetcode/leetcode-1289/</guid><description>LeetCode note for Minimum Falling Path Sum II, rebuilt from the original learning note</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://h30306.github.io/blog/leetcode/leetcode-1289/featured.png"/></item><item><title>LeetCode 576: Out of Boundary Paths</title><link>https://h30306.github.io/blog/leetcode/leetcode-576/</link><pubDate>Sun, 05 Jul 2026 00:00:00 +0000</pubDate><author>hwork0511@gmail.com (Wei Yi Chung)</author><guid>https://h30306.github.io/blog/leetcode/leetcode-576/</guid><description>LeetCode note for Out of Boundary Paths, rebuilt from the original learning note</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://h30306.github.io/blog/leetcode/leetcode-576/featured.png"/></item><item><title>LeetCode 1277: Count Square Submatrices With All Ones</title><link>https://h30306.github.io/blog/leetcode/leetcode-1277/</link><pubDate>Sat, 04 Jul 2026 00:00:00 +0000</pubDate><author>hwork0511@gmail.com (Wei Yi Chung)</author><guid>https://h30306.github.io/blog/leetcode/leetcode-1277/</guid><description>LeetCode note for Count Square Submatrices With All Ones, rebuilt from the original learning note</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://h30306.github.io/blog/leetcode/leetcode-1277/featured.png"/></item><item><title>LeetCode 931: Minimum Falling Path Sum</title><link>https://h30306.github.io/blog/leetcode/leetcode-931/</link><pubDate>Sat, 04 Jul 2026 00:00:00 +0000</pubDate><author>hwork0511@gmail.com (Wei Yi Chung)</author><guid>https://h30306.github.io/blog/leetcode/leetcode-931/</guid><description>LeetCode note for Minimum Falling Path Sum, rebuilt from the original learning note</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://h30306.github.io/blog/leetcode/leetcode-931/featured.png"/></item><item><title>LeetCode 174: Dungeon Game</title><link>https://h30306.github.io/blog/leetcode/leetcode-174/</link><pubDate>Tue, 30 Jun 2026 00:00:00 +0000</pubDate><author>hwork0511@gmail.com (Wei Yi Chung)</author><guid>https://h30306.github.io/blog/leetcode/leetcode-174/</guid><description>LeetCode note for Dungeon Game, rebuilt from the original learning note</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://h30306.github.io/blog/leetcode/leetcode-174/featured.png"/></item><item><title>LeetCode 221: Maximal Square</title><link>https://h30306.github.io/blog/leetcode/leetcode-221/</link><pubDate>Tue, 30 Jun 2026 00:00:00 +0000</pubDate><author>hwork0511@gmail.com (Wei Yi Chung)</author><guid>https://h30306.github.io/blog/leetcode/leetcode-221/</guid><description>LeetCode note for Maximal Square, rebuilt from the original learning note</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://h30306.github.io/blog/leetcode/leetcode-221/featured.png"/></item><item><title>LeetCode 62: Unique Paths</title><link>https://h30306.github.io/blog/leetcode/leetcode-62/</link><pubDate>Sat, 27 Jun 2026 00:00:00 +0000</pubDate><author>hwork0511@gmail.com (Wei Yi Chung)</author><guid>https://h30306.github.io/blog/leetcode/leetcode-62/</guid><description>LeetCode note for Unique Paths, rebuilt from the original learning note</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://h30306.github.io/blog/leetcode/leetcode-62/featured.png"/></item><item><title>LeetCode 63: Unique Paths II</title><link>https://h30306.github.io/blog/leetcode/leetcode-63/</link><pubDate>Sat, 27 Jun 2026 00:00:00 +0000</pubDate><author>hwork0511@gmail.com (Wei Yi Chung)</author><guid>https://h30306.github.io/blog/leetcode/leetcode-63/</guid><description>LeetCode note for Unique Paths II, rebuilt from the original learning note</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://h30306.github.io/blog/leetcode/leetcode-63/featured.png"/></item><item><title>LeetCode 64: Minimum Path Sum</title><link>https://h30306.github.io/blog/leetcode/leetcode-64/</link><pubDate>Sat, 27 Jun 2026 00:00:00 +0000</pubDate><author>hwork0511@gmail.com (Wei Yi Chung)</author><guid>https://h30306.github.io/blog/leetcode/leetcode-64/</guid><description>LeetCode note for Minimum Path Sum, rebuilt from the original learning note</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://h30306.github.io/blog/leetcode/leetcode-64/featured.png"/></item></channel></rss>