3250. Find the Count of Monotonic Pairs I | Weekly Leetcode 410

[@shivamchaudhary7574]

Nice explanation

[@ashutoshjha2648]

Great explanation...keep up the good work

[@dawodujohnson]

Nice as usual Please when are you dropping next videos?

[@souravshaw8904]

Great explanation 💯

[@saurabhsingh-zm9zh]

thank you mohan for simplifying the explanation , i found it very useful ❤

[@chaitanya812]

waiting from it from the very start❤

[@vamsikrishnagannamaneni912]

if all the values are unique, the dp will render useless right? Please correct me if i am wrong

[@codingmohan]

Which values you are referring to here? If you mean the array values, then No. The dp prevents recalculation of the same state (think of it in terms of recursion for easier visualization). If you remove dp, the same state might get recomputed more than once, thereby increasing the time complexity of solution. If you still not sure of it - try to do a dry run of the recursive solution once using pen and paper.

[@krishanusaha5212]

Great explanation bhaiya as always, bhaiya wp check karo na 😅