Implementation of knapsack dynamic programming
There are three bags labelled as 1, 2 & 3. The contents of bag are as following:
If a thief enters the house to steal and the maximum weight of bag he can carry is 8 kg (variable), how many items from above could he steal to maximize the worth
This problem is solved using Dynamic programming or Memorization