5 Simple Steps for Solving Dynamic Programming Problems

Video quality	The size	Download

Информация о 5 Simple Steps for Solving Dynamic Programming Problems

Название	:	5 Simple Steps for Solving Dynamic Programming Problems
Продолжительность	:	21.27
Дата публикации	:
Просмотров	:	835 rb

Mashallah perfect explanation 👌
Comment from : Aymen Belghoul

It seems like brute forcing after filtering the array ?
Comment from : wojciech kalinowski

boy is this shit boring and useless
Comment from : Guy One

Beautiful video Never really thought that directed graphs could be this useful in DP!
Comment from : Sid

Can not implement anything that requires a pcbrSomeone had to mickla with it so I had no access for monthsbrbrYesterday I had a brain meltdown and totaled the pcbrbrThis means everything is gone as the disk was encrypted, I ripped the pc in parts, battery gone, memory gone, screen gone etcbrEverything in various garbage containers cross the citybrbrSo you want implements, hand me a new one Without gremlins
Comment from : Hans Magnusson

Your explanation is really good Make more of DS ALGO videos please
Comment from : Girish Bisane

BRLLIANT video!
Comment from : Abhay Kumar Rajpoot

What exactly is dynamic here? What's the difference between dynamic and other procedural patterns? This all just seems like "how to write good algorithms", not a full paradigm
Comment from : David Hand

Great video, but please remaster the voiceover so the bass isn’t so punchy Hard to listen with headphones
Comment from : Nick Doherty

The fact that people are (very rightfully) cheering this video shows the sorry state of our math education "Dynamic programming" is not really a thing It's just mathematical induction There is absolutely nothing special about it Back in the day, we learned it in high school Now even universities don't seem to be teaching itbrbrThe term "dynamic programming" was coined by mathematician Richard Bellman due to political reasons Apparently politicians hated math and never wanted to fund mathematical research So he came up with a "bullshit name that sounds cool" to fake his way into funding br enwikipediaorg/wiki/Dynamic_programming#HistorybrbrNot to mention that Alfred Nobel also hated math, that's why there is no Nobel prize for mathbrbrSo the world was very hostile to math back in the 1950s, and it still is today We have to jump through hoops and bend over backwards to learn math "by a different name that isn't 'math' " It really sickens me
Comment from : py4e py4e

Best of explanation, visualization, succinctness with clearity and out of the crowd examples for this topic ever seen in a single video ! You got a subscriber ! BTW, which tool you use for the graphical visualization ? Do make a video on it as well ! Thanks a ton !!!
Comment from : Vishal Parkar

This same problem i applied to weighted jobs which kind of looks like same and get solved, while i was looking for this problem YouTube suggested me this 😁😁, thanks a lot 👍
Comment from : SOMDEB SAR

This is pure gold, someone please give this guy a medal !
Comment from : Victor

Okay, that is not Subsequence in first example, that is freaking Subset(or whatever Sub- you would like to name it) Sequential means following one after other w/o skips!
Comment from : Yaroslav Panych

Okay, first: why in hell everyone masturbating over the term "Dynamic Programming"? Why in hell such term even exists? Is there any other type of programming? What exactly makes any given program dynamic?
Comment from : Yaroslav Panych

Most important step : JUST START DOING IT !!!!!!
Comment from : Kartik Yadav

WaaaaaaaaaaaaaW
Comment from : tHe_VaGaBonD

Amazing Video! Thanks for subtitles, I'm a non native and your pronunciation is perfect and some words I did not knew I could read the subtitles so I could understand your video perfectly, your way of explain things is wonderful!
Comment from : Daniel Vinícius

great video you made this topic fascinating I really enjoyed watching through it!
Comment from : Fernando I Rodriguez

Not getting anything
Comment from : Non Technical Baba

your concept on relation b/w subproblems are correct but you math is wrong
Comment from : All HD movie Scene

Thank you for this video Using a directed graph as a visual is very helpful, and I don't recall it ever coming up as a strategy in my studies
Comment from : MimiKe

Very well explained video!
Comment from : Rudolf Espinola

Wow! The best explanation ever! Love it! Thank You
Comment from : PIKACHU

11:33
Comment from : Xacademia

Me watching this 5 minutes before an interview
Comment from : Vayun Ekbote

Uh is it weird that I understand the idea behind DP but I have no clue how to actually do these things on my own?? This is making no sense to me :/
Comment from : Jão

worst idea ever
Comment from : RRR

microhpone quality raping my ears
Comment from : Wristocrat

Yo
Comment from : Aditya Yadav

Short hand of LIS is: start from the end, looking for smaller You're just sharing intermediate knowledge,not true solution 😅
Comment from : mosi pvp

Thnx Didn't get it at first but it helped a lot once I took a breather to think Studying more than 8h muddles the mind a little
Comment from : Kepler _22b

This was super helpful!
Comment from : Obaloluwa Odelana

The code tracing for the box stacking problem was amazing!
Comment from : Damian Patel

I'm sure it's a great video but dude you can't be saying more cleaner in an academic video How can I trust you at all, how can I trust anyone anymore
Comment from : Pierce Gruidl

0:19 poor explanation Why do you not say this is recursive calls to calculate solution?brSimonDev has a better video on this subjectbrbrWhy is called dynamic programming? It is an over glamorized name for something that existed for years Or loop in loop if you want to avoid deep stacks
Comment from : R Foersom

I didn’t understand anything from this
Comment from : MrjavoiThe

this video is great!brsmall nitpick though, please use a monospace font for code
Comment from : RYUK

thank you so so much, this video is absolutely a lifesaver!!!
Comment from : M S

Thank you
Comment from : Abdullah and Uvejs rruka

Phenomenon!!!
Comment from : Giuseppe Coco

Thanks for the clear video! I suggest speaking a bit slower for smooth brains such as myself
Comment from : GoodHomeVideos

bro what language are you speaking I can understand nothing 😂brI am not educated enough for thisbrit's a great video though love the animations
Comment from : oximas 2004

noooo i need the knapsack problem heeeelp
Comment from : Brock Obama

My solution is getting abrLack of memory error due to some insanity I'll do
Comment from : Fitmo GMC

Can't we solve the box problem as:br1) Sort by length of a boxbr2) From array given on step (1) we found longest decreasing sequence by width of a box We can find longest decreasing sequence by reversing the original sequence, after that use LSIbr3) Sum all of the heights from array of the boxes given on step (2) brbrWe done!
Comment from : Иап Горевич

❤️🖤
Comment from : dredweiner

You have great videos, love watching you
Comment from : Starman1941

Let's solve LIS problem!brProceeds to not show the solution just talking about some vague approaches without explaining anything and bringing any value except some pretty picturesbrCool vid DislikebrIf someone's trying to solve LIS - just google it It'll take less time to understand than 10 minutes of nothing from this video
Comment from : John Smith

Thank you This video was very helpful
Comment from : Michael Chang

great videos but please get a better mic and turn off the music
Comment from : Neel Shejwalkar

Short answer : study graph and data structure, on this path you will find the path by yourself
Comment from : Simone Micucci

Why you explain so hardyuck
Comment from : Ishaat Plays

You talk too fast
Comment from : Amadeus Bojiuc

Great video sir! I appreciate the help :)
Comment from : Anthony Tafoya

I’m a huge fan of your channel May I ask your permission to repost your videos on a Chinese platform called Bilibili? Your works are very helpful for people who are into cs (especially algorithms), which is a popular field in China, but many Chinese have no access to them as youtube is banned in ChinabrI promise your channel and video link will always be included and you will always be credited as the original author in every video descriptionbrLooking forward to your new videos!
Comment from : NekoYellow

This video provides such great clarity about the steps and logic behind formulating a solution Keep up the good work!
Comment from : Tanmay Bhagwat

Isn't very clear
Comment from : Akshat Samdani

You are an absolute genius You are a mathematician , a scientist , an artist and a teacher
Comment from : Sthitaprajna Priyadarshan

The explanation is great However, i wonder, why is this called "dynamic" programming, when it is clearly about recursion, and not about mutation?
Comment from : Даниил Зуев

Great video, but can you solve the problem of your clipping microphone using dynamic programming?
Comment from : Matt Seath

@Reducible: Do you have any contact number I need to talk with you , please let me know if you have few minutes to talk Thanks
Comment from : Avdhesh Garg

We are already in a big crash Inflation is a catastrophe This CPI report is a colossal failure To bring the housing market to a halt, the FED will have to pull all the stops The unfortunate issue is that other markets are being decimated If you want to stay green, you have to rely on a lot of diversification Currently up 14 and being careful Still a better deal than leaving it in a savings or checking account yielding 0-1 percent interest
Comment from : George Robinson

Don't stop posting videos please
Comment from : Mohamed Mhiri

I don't usually comment on videos but man this is the best explanation for a programming concept that I've ever seen on YouTube
Comment from : Hassan Osama Kandil

11:45-Graphs
Comment from : Maestrul Gamer

I really liked this video However, you simplified this a lot by utilizing memoization rather than tabulation A further simplification was made by using pythonic code instead of true pseudocode It would be nice to see a more mathematically rigorous explanation with true pseudocode and tabulation
Comment from : Kevin Ayers

list is 2 3 6 9, can it also be 2 6 6 9?
Comment from : Neel Bhattacharya

In the second dp problem, why is the green box cant go on the red box?
Comment from : hagardolev

5 steps for solving DP,br1 Visualize the examplesbr2 Find an appropriate subproblemsbr3 Find relationships among subproblemsbr4 Generalize the relationshipbr5 Implement by solving subproblems in order
Comment from : Samarth G R

You deserve infinite amount of likes! Thank you!
Comment from : Vietnam Steven

thanks for this video!! i've really been struggling with DP while doing interview prep
Comment from : strawberries and cream

Great video but the background music was extremely distracting Still, the content was solid thank you!
Comment from : Rein Marichan

so much efforts to create this vdo, good work
Comment from : Pratik Jha

The Best part is you made us think through the process and how to break down a problem Amazing work
Comment from : Poshak jaiswal

Moreee
Comment from : HandSanitizer

if its increasing subsequence why are we looking for values less than? shoudln't it be greater than? 6:30
Comment from : Halcyon Ramirez

This is definitely the best explanation I've ever seen about a classic DP problem The animations and visualations give you the extra edge for sure! Would you consider making a follow-up to this video on how to solve the LIS problem in O(nlogn) time? Personally, I find that understanding the more efficient solution is much more difficult than the O(n^2) solution in this video
Comment from : Shantanu Nathan

I literally love this video This video is perfect Everything about this video, the explanation, the animation everything I cant thank you enough for this
Comment from : Saurav Shrivastav

Great probm
Comment from : Bluxer

1Visualize subproblemsbr2Find appropriate subproblemsbr3Find relationships among subproblemsbr4Generalize the relationshipsbr5Implementing by solving subproblems in order
Comment from : 5ML_Telugu