<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>Perfect Squares on Jeanphilo Blog</title><link>https://jeanphilogong.github.io/jeanblog/tags/perfect-squares/</link><description>Recent content in Perfect Squares on Jeanphilo Blog</description><generator>Hugo -- 0.168.0</generator><language>en-us</language><lastBuildDate>Thu, 08 Oct 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://jeanphilogong.github.io/jeanblog/tags/perfect-squares/index.xml" rel="self" type="application/rss+xml"/><item><title>LeetCode 279: Perfect Squares, Deriving Dynamic Programming from Remaining Sums</title><link>https://jeanphilogong.github.io/jeanblog/alg/leetcode/hot100/279-perfect-squares/</link><pubDate>Thu, 08 Oct 2026 00:00:00 +0000</pubDate><guid>https://jeanphilogong.github.io/jeanblog/alg/leetcode/hot100/279-perfect-squares/</guid><description>Start with a failed largest-square choice, then build recursion, memoization, and iterative dynamic programming to minimize the number of perfect squares.</description></item></channel></rss>