--- title: "#knapsack articles | Hashnode" description: "Explore 7 articles tagged #knapsack on Hashnode. Tutorials, guides, and how-tos from the community." url: "https://hashnode.com/tag/knapsack" --- Tag # #knapsack 7 posts · 0 followers [CHAO DU](https://hashnode.com/@chaos789) · [Dec 3, 2025](https://hashnode.com/posts/leetcode-494-target-sum-01-knapsack-reframed/692fb34228d052863b41456e) ### [LeetCode 494. Target Sum — 0/1 Knapsack Reframed](https://leetlog-by-chao.hashnode.dev/leetcode-494-target-sum-01-knapsack-reframed?utm_source=hashnode&utm_medium=feed) Learn 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](https://leetlog-by-chao.hashnode.dev/leetcode-494-target-sum-01-knapsack-reframed?utm_source=hashnode&utm_medium=feed) [CHAO DU](https://hashnode.com/@chaos789) · [Dec 2, 2025](https://hashnode.com/posts/leetcode-1049-last-stone-weight-ii/692e8c021f5b78feae751759) ### [LeetCode 1049 – Last Stone Weight II](https://leetlog-by-chao.hashnode.dev/leetcode-1049-last-stone-weight-ii?utm_source=hashnode&utm_medium=feed) A 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](https://leetlog-by-chao.hashnode.dev/leetcode-1049-last-stone-weight-ii?utm_source=hashnode&utm_medium=feed) [CHAO DU](https://hashnode.com/@chaos789) · [Dec 1, 2025](https://hashnode.com/posts/leetcode-416-partition-equal-subset-sum-my-debug-log/692d36930d028c88fde61fd4) ### [LeetCode 416 — Partition Equal Subset Sum (My Debug Log)](https://chaodu.hashnode.dev/leetcode-416-partition-equal-subset-sum-my-debug-log?utm_source=hashnode&utm_medium=feed) 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](https://chaodu.hashnode.dev/leetcode-416-partition-equal-subset-sum-my-debug-log?utm_source=hashnode&utm_medium=feed) [HR Insider - Your Career Growth](https://hashnode.com/@hrinsiderin) · [Aug 3, 2025](https://hashnode.com/posts/dynamic-programming-knapsack-and-longest-increasing-subsequence/688f58733dea950784b3204a) ### [Dynamic Programming: Knapsack & Longest Increasing Subsequence](https://hrinsiderin.hashnode.dev/dynamic-programming-knapsack-and-longest-increasing-subsequence?utm_source=hashnode&utm_medium=feed) Data Structure and Algorithm 2 min read · [hrinsiderin.hashnode.dev](https://hrinsiderin.hashnode.dev/dynamic-programming-knapsack-and-longest-increasing-subsequence?utm_source=hashnode&utm_medium=feed) [Gantogtokh Oyundalai](https://hashnode.com/@oganaa2472) · [Jun 19, 2025](https://hashnode.com/posts/dynamic-programming-essentials-understanding-key-concepts-and-exploring-dp-variants/685392039af350a36678f59b) ### [Dynamic Programming Essentials: Understanding Key Concepts and Exploring DP Variants](https://oganaa.hashnode.dev/dynamic-programming-essentials-understanding-key-concepts-and-exploring-dp-variants?utm_source=hashnode&utm_medium=feed) Learn 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.dev](https://oganaa.hashnode.dev/dynamic-programming-essentials-understanding-key-concepts-and-exploring-dp-variants?utm_source=hashnode&utm_medium=feed) [1](https://hashnode.com/posts/dynamic-programming-essentials-understanding-key-concepts-and-exploring-dp-variants/685392039af350a36678f59b) [Rasel Mahmud](https://hashnode.com/@programmingdude) · [Nov 17, 2024](https://hashnode.com/posts/key-differences-between-0-1-knapsack-problem-and-extended-greedy-knapsack-extgreedyks-algorithm/6739ce11288e88bb4382dae0) ### [Key differences between 0-1 Knapsack Problem and Extended Greedy Knapsack (ExtGreedyKS) Algorithm](https://ai-eng.hashnode.dev/key-differences-between-0-1-knapsack-problem-and-extended-greedy-knapsack-extgreedyks-algorithm?utm_source=hashnode&utm_medium=feed) highlighting the differences between the 0-1 Knapsack Problem and the Extended Greedy Knapsack (ExtGreedyKS) Algorithm: 4 min read · [ai-eng.hashnode.dev](https://ai-eng.hashnode.dev/key-differences-between-0-1-knapsack-problem-and-extended-greedy-knapsack-extgreedyks-algorithm?utm_source=hashnode&utm_medium=feed) [Rohini Singh](https://hashnode.com/@rohinisinghh) · [May 21, 2023](https://hashnode.com/posts/0-1-knapsack-problem-simply-explained/646a066c184fdb3dcf39c033) ### [0-1 KNAPSACK Problem Simply Explained](https://rohinii.hashnode.dev/0-1-knapsack-problem-simply-explained?utm_source=hashnode&utm_medium=feed) The 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](https://rohinii.hashnode.dev/0-1-knapsack-problem-simply-explained?utm_source=hashnode&utm_medium=feed)