Lesson 4 - Recursion and Dynamic Programming
Data Structures and Algorithms in Python
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:
- Problem-solving template: https://jovian.ai/aakashns/python-problem-solving-template
- Dynamic Programming problems: https://jovian.ai/aakashns/dynamic-programming-problems
Ask questions and get help on the course community forum.