LeetCode 494. Target Sum — 0/1 Knapsack ReframedLearn how LeetCode 494 Target Sum converts into a 0/1 knapsack subset-sum problem. Includes DP intuition, key edge cases, and an optimized Java solution.3 min read·leetlog-by-chao.hashnode.devDec 3, 2025
LeetCode 1049 – Last Stone Weight IIA complete debug log for LeetCode 1049: how to transform the stone-smashing game into a 0-1 knapsack and optimize it to 1D DP.3 min read·leetlog-by-chao.hashnode.devDec 2, 2025
LeetCode 416 — Partition Equal Subset Sum (My Debug Log)A step-by-step debugging journey solving LeetCode 416, from brute force and greedy attempts to the correct 0/1 knapsack DP solution.4 min read·chaodu.hashnode.devDec 1, 2025
Unique Binary Search Trees (LeetCode 96): A Complete ExplanationHow to count unique BSTs using DP and Catalan numbers. Includes diagrams, explanations, and common beginner mistakes.6 min read·leetlog-by-chao.hashnode.devNov 28, 2025
LeetCode Daily Log — Integer BreakA clear explanation of the Integer Break problem using dynamic programming and the math behind why splitting into 3s maximizes product. Includes proofs and4 min read·leetlog-by-chao.hashnode.devNov 28, 2025