How to Solve ANY Dynamic Programming Problem

preview_player
Показать описание
A comprehensive and exhaustive guide to answering ANY DP problem that may come your way. Let me know if you have any questions :)

---------------------------------------------------------------------------------------------------------------------------------------------------------------
Let's connect on LinkedIn!

Follow me on Medium!

Questions or suggestions for new videos? Email me!
Рекомендации по теме
Комментарии
Автор

Dude, you're the best. Articulate and logical. Can't ask for a better explanation.

MrTronich
Автор

Hey Aleks! Your videos are awesome. Can you please make a video on a detailed explanation of recursion and backtracking

vikasbhat
Автор

what a great human being. You deserves more subscribers

MinhNguyen-lzpg
Автор

Recently finished the first term of my first year CompSci course and got stung when the lecture introduced the recursion concept by jumping in straight to the rodCutting problem. Glad to hear DP is a hard concept to grasp as I still struggle to work that one out.
A huge thanks for making this content available to us all. No all heroes wear capes! Cheers

mrboyban
Автор

man the way and the speed you teach at just perfectly fits in with the way, I like someone to teach me and at the perfect speed, hoping to see more of your videos soon man.

prasoonrajpoot
Автор

There are dozens of video on youtube but I learn best from you :)

omerfarukbulut
Автор

Hey Aleks! Where have you been man its been a year since your last upload.

RelaxationVideos
Автор

Awesome. I really like your videos. Thanks!

kwanghyunlim
Автор

Thanks so much, this is awesome!
I would really be super grateful if you could do a video explaining Accounts Merge problem because there is not a single one good explanation on youtube and you're the best at this! Also consider opening a Patreon or something where we can give you at least some amount of money if someone wants to! :)

darod
Автор

If people looked like what their names were, you'd be
"bro", because you look like a true bro, bro.

TheUltimateSolitude
Автор

What do I do if I can't even understand how to implement the recursive solution first? I don't have any idea how you would start to solve the robot problem. All I ever get for an explanation of recursion is the basics like factorial or fibonacci sequence, but I do not know your logic for how to solve this unique paths problem, or even how you derived it.

amorfati
Автор

It's great. Your idea is more understandable and helpful than leetcode card for me. I'm lucky today to meet your video. Thank you so much.

kayehong
Автор

Awesome video, why are you not posting any videos for past few weeks 🤔

pa
Автор

Can you tackle 1335. Minimum Difficulty of a Job Schedule or 1235. Maximum Profit in Job Scheduling? Having a hard time wrapping my head around the dp

vinceluu
Автор

Just remove the ANY word from the title. Because this is all the theory etc and even the intuition is discussed everywhere, books, videos etc. But all that still does not help when trying to solve a difficult problem. So I was expecting that you will also introduce the intuition both for recursion and DP with more complex problems so that practice and thought process will help solve ANY problem. But you just discussed one problem and probably the most easiest one and call the video title as ANY. I can guarantee that just by watching this video even you will not be able to the next difficult problem where DP will "improve" the recursion. Ask yourself.

NitirajSinghRathore
visit shbcf.ru