Lesson 4 - Recursion and Dynamic Programming

Data Structures and Algorithms in Python

← Back

Course Home

Lesson 1 - Binary Search, Linked Lists and Complexity Assignment 1 - Binary Search Practice Lesson 2 - Binary Search Trees, Traversals and Recursion Assignment 2 - Hash Tables and Python Dictionaries Lesson 3 - Sorting Algorithms and Divide & Conquer Assignment 3 - Divide and Conquer Practice

← Back

Course Home

Lesson 5 - Graph Algorithms (BFS, DFS & Shortest Paths)Project - Step-by-Step Solution to a Programming Problem Lesson 6 - Python Interview Questions, Tips & Advice

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.

Notebooks

Your Notebooks

aakashns/dynamic-programming-problems

Code it Yourself

aakashns/python-problem-solving-template

Code it Yourself