Online Course on Dynamic Programming

Dynamic Programming : Excel in Dynamic Programming and Ace your next coding Interview

In this Udemy course, you will learn about the famous optimisation technique of Dynamic Programming. You will learn the basics of writing a Dynamic Programming Solution and how to find time complexity of these solutions. A number of examples are considered to help you understand better. These examples are divided into three categories : 1-Dimensional,2-Dimensional and Bitmasking Problems. For each of the category we will have 2 different problems. 

1-Dimensional Problems

1. Nth Fibonacci Term
2. Longest Increasing Subsequence

2-Dimensional Problems

1. Longest Common Subsequence
2. Longest Palindromic Subsequence

Bitmasking Problems

1. Travelling Salesman Problem
2. Assignment Problem

It is a beginner level course. Prior knowledge of recursion and a programming language would be helpful. Below is a preview video of this course. 

Check out my discount link for this course. Sometimes Udemy offers discount of it's own, more than what i am allowed to offer. You can check it out here : Udemy . Choose one suitable for you.

After this course, all that would be left on your part is practice. With time i intend to add more and more content in this course. So let's join me in this course.