What is Dynamic Programming and how is it done?

This is how we can start learning Dynamic Programming. It is an extensively used concept when solving problems for competitive programming and interviews.

Dynamic Programming involves taking a recursive approach to problem solving and then memoizing subproblem solutions.

You will often find Dynamic Programming in interview and competitive programming questions. They usually rely more on intuition and mathematical clarity than deep knowledge of data structures. Intensive mathematical proof for a problem is rarely needed before trying out a DP approach.

References:
Introduction to Algorithms - Cormen

#dynamic-programming #dp #competitive-programming

[ravikiranpns]

Dynamic Programming -
1) Find The Recursive Solution
2) Try to find if there is a lot of repetitive states in it
3) Store them in Matrix
4) Don't need to recompute the same thing again and again :)
5) Just store it, and that's what Dynamic programming is!! Simply put!!! :)

Starting with my first DP problem - Longest common Sub Sequence / Sub String.

I Liked the Video, Subscribed and Even written comment!!!

Thanks. Cheers.. Best of Luck!!! Rock On :) Jai Shree Ram !!!

[anmoldubey]

Looking at the thumbnail first, I thought the video title would be "How to deal with stress and anxiety? ".

[flickswift]

I really like your teaching style..plz don't ever stop uploading videos go on....😀

[sagaradhikari]

At first i was very much scared to get myself into this ds and algo journey but after watching u and abdul bari sir all my ds and algo concepts seems crystal cleared, thanks to all of u guys for providing this amazing content for free of cost

[thestranger]

Those who don't remember their past are condemned to repeat it : DP

[zorksox]

My latest class in Analysis of Algorithms was an introduction to Dynamic Programming. After the class, I was so confused. My prof talked about all sorts of things, but failed to actually define DP :( Thanks for this video. Things make more sense, now.

[charlie]

Don't stop making videos related to programming. You are very good at teaching and explaining. Thanks.

[Chanmishra]

Good Job Gaurav. No one really checks optimal substructure and other things, cause once you get the recursion you will immediately know if it is repeating the task. And only thing we need to do is to push the sub results into a matrix cause MATRIX is the key ;)

[tainoormanyar]

the last point made me click like button Thanks

[anshuprakash]

Most influencing guy in the field of programming, keep going and motivating like this..

[divikmittal]

Thanks gkcs for another good video. I would request you to make some more editorial videos of problems like DIV 2 C D because thats the phase most of us stuck at.

[amit]

"who wrote this, anyways" haha, Huge thanks for this nice video, DP sounds so terrific but if said in other ways as you said it makes it much more cooler and interesting.

[saurabh]

watched this 2 times beautifully crafted

[shibajyotidas]

Your explanations are so pinpoint and clear, Thanks!

[Varunshrivastava]

If you want to learn dynamic programming for interviews then just practices all types of patterns thats the only way. But if you want to understand dynamic programming - the crux of it - then deep dive into Bellman Ford algorithm and the mathematics of it that is used to prove the algorithm. You will know the origin of DP then.
But still you have to practice DP insanely for the interviews because you only get 15 minutes max to come up with a solution. That time is to recall, not to devise and algorithm. So bottom line - Practice. Phewww

[ujjwalpandey]

Most amazing description, amazing. I was looking for something like this.
Please prepare more like them for other algorithms too.

[aishwarya]

The end was so coool.. 😂... Well thanks a lot

[svdfxd]

Awesome way of presentation....with bit of much needed humor.

[AkashSharma-nmjc]

When will u release "tourist"'s interview? Eagerly waiting for it since deletion.

[yashaswikulshreshtha]

His speaking skills appear to be intuitive and can be visualuzed easily.