"0-1 Knapsack" || "Dynamic Programming"|| "Memoization and Tabulation" || "Explaination With Code"

"In this video i have discussed a problem named 0-1 Knapsack. We are given n items alongwith their weights and values. We have a bag of a given capacity and we have to place items in it in such a way that the bag have the maximum value of the items.