Review knapsack code problems

**Basic Abstractions**

Name | Summary |
---|---|

0/1 Knapsack with one bag | For each item, take or don’t take. Leetcode: Coin Change |

0/1 Knapsack with 2 bags | For each item, either put to bag1, bag2 or drop. Leetcode: Tallest Billboard |

0/1 Knapsack with 4 bags | Leetcode: Matchsticks to Square |

Complete knapsack problem | Unlike 0/1 Knapsack, items can be used multiple times. Leetcode: Coin Change 2 |

Complete knapsack problem in high dimension | Leetcode: Shopping Offers |

Group knapsack problem | Knapsack with selection from distinct groups |

See all knapsack problems: #knapsack

- Review: Knapsack Problems
- Leetcode: Three Equal Parts
- Leetcode: Target Sum
- Leetcode: Tallest Billboard
- Leetcode: Shopping Offers
- LeetCode: Reducing Dishes
- Leetcode: Partition Equal Subset Sum
- Leetcode: Order Problem
- Leetcode: Ones and Zeroes
- Leetcode: Number of Dice Rolls With Target Sum

See more blog_{posts}.