Minimum Cost to Cut a Stick || Merge Stones || Burst Ballons || Dynamic Programming || Leetcode 1547

[@abhimanyuambastha2595]

Loved your explanation. I watch different approaches from Neetcode, Striver and others too. Yours felt the most intuitive to come up with in this problem

[@shubhamagarwal9182]

dhanyavad

[@himanshu_1422]

bro u are god in explaining stuff damn this seems so easy now

[@yagnikpatel4404]

Aryan can't we use binary search logic with nearest cuts[i] index after sorting cuts array ?

[@VivekYadav-ds8oz]

That is indeed one way to do it. I thought of it first, however realised that my cuts array already has that "binary search" in it. It's just the previous element.

[@FlyToJupiter]

Thank you! I really loved the part you mentioned that you would have sticked with the first version of memoized code and I wanted to ask that! Because the optimisation seems hard to come up with under pressure or not as intuitive immediately.

[@jambajuice07]

impressive , better than striver's tbh

[@gangsta_coder_12]

Excellent explanation

[@sondidu]

These sticks are giving me a headache

[@arshpreetsingh9618]

Why can't we greedily make the cut which is closest to the center of the stick? and we can call the same function for the left part of the cut and the right part of the cut

[@SHREYAGGARWAL-t4b]

Bro Notifications XD

[@adarshtiwari6742]

Keep up the work❤❤❤❤

[@jagratgupta8392]

nice explaination bhaiya its a really tough problem.......couldnt think this much😅😅🥲

[@adarshtiwari6742]

Nice work man❤❤

[@codebyprince4562]

Kitna 😂😂😂 ok bolega yr

[@pulkitranjan8189]

bharti aggarwal ;)

[@kshitijofthejune]

"Ok"

[@infinitygaming7192]

Bro today's contest

[@ARYANMITTAL]

Coming up brooo ❤️

[@siddarthreddykoppera5930]

@@ARYANMITTAL when ?