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
- LeetCode: Matchsticks to Square
- LeetCode: Last Stone Weight II
- LeetCode: Integer Break
- LeetCode: Form Largest Integer With Digits That Add up to Target
- LeetCode: Combination Sum IV
- LeetCode: Combination Sum
- LeetCode: Coin Change 2
- LeetCode: Coin Change

See more blog posts.