In this 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. We will consider a number of examples 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

After this course, all that would be left on your part is practice. So let's join me in this course.