<?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>LeetCode 40 on Jeanphilo Blog</title><link>https://shio-chan-dev.github.io/jeanblog/tags/leetcode-40/</link><description>Recent content in LeetCode 40 on Jeanphilo Blog</description><generator>Hugo -- 0.161.1</generator><language>en-us</language><lastBuildDate>Fri, 17 Apr 2026 14:31:10 +0800</lastBuildDate><atom:link href="https://shio-chan-dev.github.io/jeanblog/tags/leetcode-40/index.xml" rel="self" type="application/rss+xml"/><item><title>LeetCode 40: Combination Sum II (Backtracking / Same-Layer Dedup ACERS Guide)</title><link>https://shio-chan-dev.github.io/jeanblog/alg/leetcode/40-combination-sum-ii/</link><pubDate>Fri, 17 Apr 2026 14:31:10 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/alg/leetcode/40-combination-sum-ii/</guid><description>Learn LeetCode 40 by deriving same-layer duplicate skipping, use-once recursion, and sorted pruning from the problem itself.</description></item></channel></rss>