Dynamic Programming
Dynamic Programming
Yeah! I know DP, It is the Most Difficult topic in Algorithms.
But this is only the One side of the story, Let's break some myths about DP
But this is only the One side of the story, Let's break some myths about DP
Yeah, But this is Only the One side of the story, Let's Break some of the myths about DP
But this is only the One side of the story, Let's break some myths about DP
Yeah, But this is Only the One side of the story, Let's Break some of the myths about DP!
But this is only the One side of the story, Let's break some myths about DP
Yeah, But this is Only the One side of the story, Let's Break some of the myths about DP!
Myth 1: Dynamic Programming is the toughest topic in Algorithms.
But this is only the One side of the story, Let's break some myths about DP
Yeah, But this is Only the One side of the story, Let's Break some of the myths about DP!
Myth 1: Dynamic Programming is the toughest topic in Algorithms.
Myth 2: Dynamic Programming is always used when there is a problem involving optimality.
Ex. knapsack problem.
But this is only the One side of the story, Let's break some myths about DP
Yeah, But this is Only the One side of the story, Let's Break some of the myths about DP!
Myth 1: Dynamic Programming is the toughest topic in Algorithms.
Myth 2: Dynamic Programming is always used when there is a problem involving optimality.
Ex. knapsack problem.
Myth 3: There is always a fixed formula or a pattern which follows
in DP
Taking the context to our early education and midset!!
Taking the context to our early education and midset!!
In our secondary education we learnt about quadratic equations and finding the roots of quadratic equation..!!
Taking the context to our early education and midset!!
In our secondary education we learnt about quadratic equations and finding the roots of quadratic equation..!!
By quadratic formula..!!
By intution..!!
WHAT ARE WE GOING TO GET IN THIS SERIES ?
Series Duration
WHAT ARE WE GOING TO GET IN THIS SERIES ?
Series Duration
15 Days
WHAT ARE WE GOING TO GET IN THIS SERIES ?
Series Duration
15 Days
What will we be doing in these 15 days?
WHAT ARE WE GOING TO GET IN THIS SERIES ?
Series Duration
15 Days
Each Day consists of a DP Problem
Every DP problem is different from other problems and we will learn a different concept or a pattern in DP.
WHAT ARE WE GOING TO GET IN THIS SERIES ?
Series Duration
15 Days
Each Day consists of a DP Problem
Every DP problem is different from other problems and we will learn a different concept or a pattern in DP.
If you want a DP problem to cover in this series.
Go to Comments
Paste your problem description or the url of the problem page
That's it! If everything went well we will publish solution to your problem.
What DP is all about ??
Practice!! Practice!! Practice!!
Doing less work and getting accurate results.
Effectively using the memory..!!
Breaking up a problem into smaller sub-problems..!!
Getting started..!!
Various portions are involved in dynamic programming..!!
Types of problems???
What is the tabulation method??
What is optimal substructure??
Top-down or Bottom-up approach??
What's the best way to understad this?
Getting the knowledge of these concepts practically..!!
How do we that??
By working on problems with us.. and getting the clear understanding of concepts.. without memorizing the text stuff..!!
Outcomes of this Series
Outcomes of this Series
This series does not guarantee that you will become master of DP after Completing.
Outcomes of this Series
This series does not guarantee that you will become master of DP after Completing.
Instead, it can promise that you will never fear to attempt a DP problem in Future.
Outcomes of this Series
This series does not guarantee that you will become master of DP after Completing.
Instead, it can promise that you will never fear to attempt a DP problem in Future.
To Master DP you require Time and Practice.
This series will make you familiar with the most used patterns in the DP and hence make you comfortable in solving DP problems
What we expect from you.
What we expect from you.
We are making a lot of Efforts in making these videos for you.
What we expect from you.
We are making a lot of Efforts in making these videos for you.
1. Maintain Consistency.
What we expect from you.
We are making a lot of Efforts in making these videos for you.
1. Maintain Consistency.
2. Please Subscribe and hit the bell icon so that you will never miss a single video in this series.
What we expect from you.
We are making a lot of Efforts in making these videos for you.
1. Maintain Consistency.
2. Please Subscribe and hit the bell icon so that you will never miss a single video in this series.
3. Every Day we are going to release the problem that we will cover next day. Till then you should attempt that problem on your own.
What we expect from you.
We are making a lot of Efforts in making these videos for you.
1. Maintain Consistency.
2. Please Subscribe and hit the bell icon so that you will never miss a single video in this series.
3. Every Day we are going to release the problem that we will cover next day. Till then you should attempt that problem on your own.
What we expect from you.
We are making a lot of Efforts in making these videos for you.
1. Maintain Consistency.
2. Please Subscribe and hit the bell icon so that you will never miss a single video in this series.
3. Every Day we are going to release the problem that we will cover next day. Till then you should attempt that problem on your own.
4. Last but not least, Enjoy problem-solving live life happily, If you stuck at any point you can write your query on comments or directly contact on emails provided in description.
What we expect from you.
We are making a lot of Efforts in making these videos for you.
1. Maintain Consistency.
2. Please Subscribe and hit the bell icon so that you will never miss a single video in this series.
3. Every Day we are going to release the problem that we will cover next day. Till then you should attempt that problem on your own.
4. Last but not least, Enjoy problem-solving live life happily, If you stuck at any point you can write your query on comments or directly contact on emails provided in description.
Dynamic Programming
By Chirayu Jain
