Course Description

In this course, you will learn how to solve several problems using Dynamic Programming. We will discuss several 1 dimensional and 2 dimensional dynamic programming problems and show you how to derive the recurrence relation, write a recursive solution to it, then write a dynamic programming solution to the problem and code it up in a few minutes! We will cover problems such as:

1.Climbing stairs

2.Buying and Selling Stock

3.0/1 Knapsack

4.Longest Common Substring

5.Longest Common Subsequence

6.Others!

By the end of this course, you should be fairly confident to tackle dynamic programming problems and to begin your journey in learning more Dynamic programming problems and solutions. 

Course Details
en
en
El Farouk Yasser
Self-paced
Beginner
3 hours
Course Details
en
en
El Farouk Yasser
Self-paced
Beginner
3 hours
Course Description

In this course, you will learn how to solve several problems using Dynamic Programming. We will discuss several 1 dimensional and 2 dimensional dynamic programming problems and show you how to derive the recurrence relation, write a recursive solution to it, then write a dynamic programming solution to the problem and code it up in a few minutes! We will cover problems such as:

1.Climbing stairs

2.Buying and Selling Stock

3.0/1 Knapsack

4.Longest Common Substring

5.Longest Common Subsequence

6.Others!

By the end of this course, you should be fairly confident to tackle dynamic programming problems and to begin your journey in learning more Dynamic programming problems and solutions.