0-1 KnapSack Introduction L03

I hope you all understood the Fractional Knapsack by now. If not, go back and check out the previous lecture

• Recursion

Since it's the first lecture on DP, I'll be solving this problem with three different approaches:

1. Pure Recursion
2. Memoization + Recursive Calls (Top-Down Approach or Memoization)
3. Memoization + Iteration (Bottom-Up Approach or Tabulation)

Happy Coding!