Review: Knapsack Problems Posted on January 24, 2018December 31, 2019 by braindenny Review knapsack code problems CheatSheet: Leetcode For Code Interview CheatSheet: Common Code Problems & Follow-ups 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 ProblemsLeetcode: Three Equal PartsLeetcode: Target SumLeetcode: Tallest BillboardLeetcode: Shopping OffersLeetcode: Partition Equal Subset SumLeetcode: Order ProblemLeetcode: Ones and ZeroesLeetcode: Number of Dice Rolls With Target SumLeetcode: Matchsticks to Square See more blogposts. Post Views: 12