Master the art of Dynamic Programming

Introduction to recursion and why it is important for dynamic programming.

Exercise questions to practice recursion.

Solutions to the exercise problems.

An introduction to backtracking , which is a very useful programming technique to solve many algorithm problems.

Backtracking helps us implement naive recursive solutions from scratch which can later be optimized using Dynamic programming techniques.

Exercise problems to practice backtracking.

An introduction to Dynamic programming, different approaches to implement dynamic programming solutions and pros and cons of each of those approaches.

Exercise problem to practice top down and bottom up approach for implementing Dynamic programming solution.

An introduction to optimization problems, optimal substructure property and recursive optimization procedure.

A detailed explanation of step by step approach to solve any dynamic programming solution from scratch with knapsack problem as the example.

A detailed explanation of how to reconstruct the actual solution to Dynamic programming problems with knapsack problem as the example.

Exercise to better understand the step by step approach by applying the approach to solve a nice dynamic programming problem.

Introduction to identifying and solving one dimensional dynamic programming problems with an example. The example problem is optimum way to rob a row of houses without being caught by the police.

A detailed explanation about using step by step approach to solve the rod cutting problem from scratch.

O(nlgn) solution for "Longest Increasing Subsequence"

https://www.geeksforgeeks.org/longest-monotonically-increasing-subsequence-size-n-log-n/

Exercise problems to practice step by step approach for solving one dimensional dynamic programming problems.

1. Minimum cost of reaching the last stone by jumping a maximum of X stones at a time

2. Counting the number of ways in which a string can be broken completely into valid words.

Introduction to two dimensional dynamic programming problems and a detailed explanation of how the step by step approach can be used to solve such problems with an example.

Example used : Minimum cost patch to travel from top left corner in a grid to bottom right corner of the same grid.

A detailed explanation of how we can use step by step approach to solve one of the classic two dimensional dynamic programming problem.

Longest common subsequence.

A detailed explanation of using step by step approach to solve the "minimum number of deletions required to make a string palindrome" problem.

A detailed explanation of solving "Edit distance" problem using step by step approach.

A detailed explanation of solving "Regular expression matching" problem using step by step approach and also analyzing its time and space complexity.