3122. Minimum Number of Operations to Satisfy Conditions | DP & Not Greedy

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/ary...
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

[@ARYANMITTAL]

Updated Discord Link - discord.gg/vwUAz2pEHZ ❤
.
Practice Greedy - ua-cam.com/play/PLEL7R4Pm6EmDVCYD5EkNv08vSOC4kA1_z.html
Practice DP - ua-cam.com/play/PLEL7R4Pm6EmCXe8803IBAPWVsHlTVrtOp.html

[@iamnoob7593]

UNDERSTOOD , This was not a typical standard Recursion/dp question , I think this question needs to be marked as HARD. Thanks for the wonderful explanation.

[@tanveeralam3971]

amazing explanation hats off to you

[@ayushtandon1719]

Good Explaination

[@Syed_Shifat]

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;

[@tirthrami9550]

thank you sir to clear our concept

[@harshdiwase1941]

bro , your explanation was superb , gonna try it by myself now , Thank you for the video

[@uzairkhan-zq7fh]

Very detailed explanation thanks aryan

[@simranray4564]

thanks for providing such a detailed explaination, 'was much needed++

[@devmadaan5146]

never worry for any engagement issues ! i will always be with u :)

[@IK-xk7ex]

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 :)

[@apputadhiyal9451]

Thanks for the explanation!

[@silverpoision]

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.

[@IK-xk7ex]

We use cache, that reduce the time complexity. So you have to calculate each combination only and only once.

[@IK-xk7ex]

Without caching (vector dp) you will repeat calculations for the same combinations again and again.

[@Leetcode194]

cost+=1 instead of cost+=grid[i][j]?

[@ameerkhan5054]

Superb ❤

[@nagasrisaichaitanyakolluri8173]

🎉🎉thanks bro

[@ashutoshraj7171]

what if, if you only provide the solution (iff)

[@dhruvrawatt9]

01:42

[@dhruvrawatt9]

support++

[@dileepkumar-hm5wk]

Not clear