Hey guys,
As some people asked me in the comment section of the previous videos, I have prepared a video discussing how to approach DP problems.
In this video, I discuss the way that I teach my students to think about DP problems. It consists of 4 steps:
- Definition
- Base Case
- Update
- Final Answer
I will apply this method to solve two problems—Chocolate Bar from Codeforces and Independent Set from Atcoder.
I've added this video to the DP playlist that I've prepared, which currently includes 'Recursion', 'DP & Memoization', and this video:
https://www.youtube.com/playlist?list=PLzDmwrrgE-UVKGwxoYao36BVTvBozwLoG
Feel free to join our Discord channel to further discuss these topics and chat with the CP legends I will interview.
Let me know whether this approach works for you and whether you like these kinds of videos. As always, I appreciate all your feedback—positive or negative.
try to cover full DP Please..............
Will do. Thanks for the feedback.
subscribed your channel. please continue the good work.
Thanks, man. I appreciate your support.
Good job, it's the same method that I've been teaching for years :) Works everytime (until you have to add fifth step — optimization, that's when it gets tricky...) Good work on the channel.
Thanks, man!
Yeah, this approach can really help to think on DP problems in a structured way. As you said, there's a mysterious 5th step in some DP problems which is 'Optimization'. Will try to cover that in my next videos.
The feedback from experienced educators like you is so valuable to me. Please feel free to reach out to me whenever you had any feedback or suggestions.
subscribed,try to cover full dp if possible.
Thanks for your support. With your warm words and support, I'll definitely do it.
Your videos are really good quality. subscribed. Please make also guidlines for studying.