Please visit the Lesson Page for more detailed info
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:
- Problem-solving template: https://jovian.ai/aakashns/python-problem-solving-template
- Dynamic Programming problems: https://jovian.ai/aakashns/dynamic-programming-problems
Asking/Answering Questions :
Reply on this thread to ask questions during and after the lecture. Before asking, scroll through the thread and check if your question (or a similar one) is already present. If yes, just like it. During the lecture, we’ll answer 8-10 questions with the most likes. The rest will be answered on the forum. If you see a question you know the answer to, please post your answer as a reply to that question. Let’s help each other learn!