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.
- Problem-solving template: aakashns/python-problem-solving-template - Jovian
- Dynamic Programming problems: aakashns/dynamic-programming-problems - Jovian
Asking/Answering Questions :
Reply to this thread to ask questions. Before asking, scroll through the thread and check if your question (or a similar one) is already present. If yes, just like it. We will give priority to the questions with the most likes. The rest will be answered by our mentors or the community. 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!