Rare but "MUST KNOW" DP Concept 🔥| 3409. Longest Subsequence With Decreasing Adjacent Difference |

[@ARYANMITTAL]

Short - ua-cam.com/users/shorts_Gb8CiwqdsY?feature=share

[@moazgamal1429]

thanks man, really great effort.

[@mukulkhanna5071]

best video like always

[@Its_Shubham_Negi]

Finally it's here!! ❤❤

[@ARYANMITTAL]

Shubham bhai ❤🔥

[@Its_Shubham_Negi]

Hey u know me?? 😅❤❤​@@ARYANMITTAL

[@fraserdab]

good morning welcome back....at night 11:30 anyways thanks for upload

[@ARYANMITTAL]

🤣🤣

[@ajayc815]

watched almost 5 times 😃😃

[@andr3w321]

Couldn't follow tbh. Need less explaining and more dry running of a small simple example.

[@ARYANMITTAL]

By my experience some problems shouldn’t be understood by dry run & this is one such problem. (Apart from suffixMax portion, which can be understood by dry run)
This problem involved “how to reach” & “why to use” a specific technique, if you have watched video maximum twice & had a copy pen with you while i was explaining, & still this isn’t understandable, then i might recommend solving more dp medium problems first (apart from those so called sheet problems)

[@Anonymous____________A721]

🔥🔥

[@Mad_Monk29]

i have a doubt isnt 1e8 works under time limit ..?? , btw nice editorial

[@cse_33_ayandutta48]

Could you please explain the 4th one,cause this only question is challenging

[@ajayc815]

🥰🥰🥰🥰

[@ajayc815]

🥰🥰🥰🥰🥰🥰🥰

[@JeetuKumar-wd1uw]

Bhai recursion wala code bhi bata do sarh mai

[@ARYANMITTAL]

Bhai full video dekho pata chal jaaega, why top down is super tricky here & bottom up much simpler🫂

[@sukhpreetsingh5200]

🔥🔥🔥