Hindi version: https://youtu.be/c6AYl5bONRI
This lecture covers recursion, memoization, and dynamic programming. We look at two common problems in dynamic programming: longest common subsequences and knapsack problems.
Notebooks used in this lesson:
Ask questions and get help on the course community forum.