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

[@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.

[@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;

[@devmadaan5146]

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

[@tanveeralam3971]

amazing explanation hats off to you

[@harshdiwase1941]

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

[@HighOctane-k4m]

thank you sir to clear our concept

[@simranray4564]

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

[@apputadhiyal9451]

Thanks for the explanation!

[@uzairkhan-zq7fh]

Very detailed explanation thanks aryan

[@ameerkhan5054]

Superb ❤

[@ARYANMITTAL]

Updated Discord Link - discord.gg/vwUAz2pEHZ ❤ . Practice Greedy - kzbin.info/aero/PLEL7R4Pm6EmDVCYD5EkNv08vSOC4kA1_z Practice DP - kzbin.info/aero/PLEL7R4Pm6EmCXe8803IBAPWVsHlTVrtOp

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

[@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.

[@ashutoshraj7171]

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

[@nagasrisaichaitanyakolluri8173]

🎉🎉thanks bro

[@dhruvrawatt9]

01:42

[@dileepkumar-hm5wk]

Not clear

[@dhruvrawatt9]

support++