# Knapsack Problem

- [322 Coin Change](/oj-practices/chapter1/dynamic-programming/knapsack-problem/322-coin-change.md)
- [377 Combination Sum IV](/oj-practices/chapter1/dynamic-programming/knapsack-problem/377-combination-sum-iv.md)
- [416 Partition Equal Subset Sum](/oj-practices/chapter1/dynamic-programming/knapsack-problem/416-partition-equal-subset-sum.md)
- [474 Ones and Zeroes](/oj-practices/chapter1/dynamic-programming/knapsack-problem/474-ones-and-zeroes.md)
- [494 Target Sum](/oj-practices/chapter1/dynamic-programming/knapsack-problem/494-target-sum.md)
- [518 Coin Change 2](/oj-practices/chapter1/dynamic-programming/knapsack-problem/518-coin-change-2.md)