Identify

• 0/1 Knapsack pattern is very useful for solving the famous Knapsack problem by using Dynamic Programming techniques
• Knapsack problem is all about optimization
  • for example, given a set of items, each with a weight and a value, determine the number of each item to include in a collection so that the total weight is less than or equal to a given limit and the total value is as large as possible

Motive

• we are going to use top-down Memoisation or bottom-up Tabulation technique to solve the problems efficiently

Common Problems

• [ ] LeetCode 416 - Partition Equal Subset Sum [medium]
• [ ] LeetCode 474 - Ones and Zeroes [medium]