3122. Minimum Number of Operations to Satisfy Conditions | DP & Not Greedy
HTML-код
- Опубликовано: 19 апр 2024
- In this video, I'll talk about how to solve Leetcode 3122. Minimum Number of Operations to Satisfy Conditions | DP & Not Greedy
Let's Connect:
📱Discord (Join Community) : / discord
📝Linkedin: / aryan-mittal-0077
📸 Instagram: / ez.pz.dsa
💻 Twitter - / aryan_mittal007
🤖 Github: github.com/aryan-0077
About Me:
I am Aryan Mittal - A Software Engineer in Goldman Sachs, Speaker, Creator & Educator. During my free time, I create programming education content on this channel & also how to use that to grow :)
✨ Hashtags ✨
#programming #Interviews #leetcode #faang #maang #datastructures #algorithms
amazing explanation hats off to you
I regularly wait for your videos after the contest to solve the problems that I couldn't solve there. Keep up the good work, man;
thank you sir to clear our concept
Very detailed explanation thanks aryan
Thanks for the explanation!
bro , your explanation was superb , gonna try it by myself now , Thank you for the video
never worry for any engagement issues ! i will always be with u :)
thanks for providing such a detailed explaination, 'was much needed++
🎉🎉thanks bro
Superb ❤
Thank you for the video, but I'm still stuck to convert TopDown solution to BottomUp. I understand what we need to have 2D array, which [rows][10] and fill it Int.max. But then I have no idea what to do :)
cost+=1 instead of cost+=grid[i][j]?
Bro I am confused about the time complexity. If at every index we call the recursive function 8 times then the time complexity of the function should be 9^m na? Please explain me what I am missing because I have read some blogs on calculating time complexity of recursive functions and this is what they exactly say.
We use cache, that reduce the time complexity. So you have to calculate each combination only and only once.
Without caching (vector dp) you will repeat calculations for the same combinations again and again.
Updated Discord Link - discord.gg/vwUAz2pEHZ ❤
.
Practice Greedy - ruclips.net/p/PLEL7R4Pm6EmDVCYD5EkNv08vSOC4kA1_z
Practice DP - ruclips.net/p/PLEL7R4Pm6EmCXe8803IBAPWVsHlTVrtOp
support++
what if, if you only provide the solution (iff)
01:42
Not clear