CCHAO DU·Dec 3, 2025LeetCode 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.dev
CCHAO DU·Dec 2, 2025LeetCode 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.dev
CCHAO DU·Dec 1, 2025LeetCode 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.dev
HHR Insider - Your Career Growth·Aug 3, 2025Dynamic Programming: Knapsack & Longest Increasing SubsequenceData Structure and Algorithm2 min read·hrinsiderin.hashnode.dev
GGantogtokh Oyundalai·Jun 19, 2025Dynamic Programming Essentials: Understanding Key Concepts and Exploring DP VariantsLearn the fundamentals of Dynamic Programming with real examples, types like Knapsack, LIS, LCS, and clear visualizations for beginners to pros.9 min read·oganaa.hashnode.dev1C
RRasel Mahmud·Nov 17, 2024Key differences between 0-1 Knapsack Problem and Extended Greedy Knapsack (ExtGreedyKS) Algorithmhighlighting the differences between the 0-1 Knapsack Problem and the Extended Greedy Knapsack (ExtGreedyKS) Algorithm:4 min read·ai-eng.hashnode.dev
RRohini Singh·May 21, 20230-1 KNAPSACK Problem Simply ExplainedThe 0-1 Knapsack is a classical DP problem that is asked in interviews. Simply put, we are given a set of values and their corresponding weights. We need to determine the items to include in a knapsack so that the sum of those values/weights is the m...4 min read·rohinii.hashnode.dev
