https://jeanphilogong.github.io/jeanblog/tags/pruning/Recent content in Pruning on Jeanphilo BlogHugo -- 0.168.0en-usFri, 17 Apr 2026 14:31:12 +0800https://jeanphilogong.github.io/jeanblog/alg/leetcode/216-combination-sum-iii/Fri, 17 Apr 2026 14:31:12 +0800https://jeanphilogong.github.io/jeanblog/alg/leetcode/216-combination-sum-iii/Learn LeetCode 216 by deriving fixed-length combination search, use-once recursion, and bounded 1..9 pruning from the problem itself.https://jeanphilogong.github.io/jeanblog/alg/leetcode/40-combination-sum-ii/Fri, 17 Apr 2026 14:31:10 +0800https://jeanphilogong.github.io/jeanblog/alg/leetcode/40-combination-sum-ii/Learn LeetCode 40 by deriving same-layer duplicate skipping, use-once recursion, and sorted pruning from the problem itself.https://jeanphilogong.github.io/jeanblog/alg/leetcode/hot100/backtracking/39-combination-sum/Wed, 08 Apr 2026 16:22:57 +0800https://jeanphilogong.github.io/jeanblog/alg/leetcode/hot100/backtracking/39-combination-sum/A practical guide to LeetCode 39 that builds combination backtracking from scratch, explains remain-based state, and shows why sorting makes pruning safe.https://jeanphilogong.github.io/jeanblog/dev/algorithm/graph/70-subgraph-matching-vf2-ullmann-and-pruning/Mon, 09 Feb 2026 09:59:16 +0800https://jeanphilogong.github.io/jeanblog/dev/algorithm/graph/70-subgraph-matching-vf2-ullmann-and-pruning/A systematic guide to Subgraph Isomorphism (NP-hard) and the core ideas of VF2/Ullmann, with emphasis on engineering reality: constrained pattern queries and candidate pruning usually matter more than the algorithm name itself.