Count the Number of Good Partitions | Intuition | Leetcode-2963 | Weekly Contest 375

[@sauravchandra10]

Jitna mushkil question tha, utna hi easy aapka explanation! Thanks!

[@raisanjeeb42]

Thank You bhaiya for providing a clear solution !

[@heyOrca2711]

Great Question!!

[@User-student-404]

5/02/2024 @ 00:34 done with 2 pointer series . tomorrow going to take sliding window technique playlist . bhiaya thanks a lot 🤎apne ek baar jo samja diya kabhi bhi bul nhi sakte bas apke videos 1x pe dekhta hu . completed : 1) leetcode easy 2) 2 pointer 3) sliding window from tomorrow onwards. 🙂🤎

[@codestorywithMIK]

❤️❤️

[@DevOpskagyaan]

Thank you so much for listening to our requests ❤️ No one explains like you

[@anuppatankar4294]

Thank you very much 👍🏻

[@ugcwithaddi]

You are a complete Genius 🔥🙌

[@diyadey8408]

Thank you soo soo much❤ Please continue making videos for the 3rd and 4th question of all leetcode contests...it would be of great help for everyone. Thank you once again 😇

[@ashishverma1382]

good explanation

[@codestorywithMIK]

Thank you 🙏❤️

[@kashafkhan9726]

Your intuition building is tremendous 🙌.

[@codestorywithMIK]

Means a lot ❤️❤️🙏🙏

[@chaitanya812]

yar bs maza aagya 😊

[@codestorywithMIK]

😇❤️🙏

[@Kumar-up2lj]

As always better than everyone

[@souravjoshi2293]

Don't ever get demotivated because of low likes/views. You are just phenomenal. People will soon find this hidden gem.

[@md.tamaltahasinkhan6448]

I don't know how to thank you. Completely broke down the problem into smaller pieces. From this point any beginner could understand it. Watching your videos is more interesting than watching a thriller movie to me. ❤

[@rishabhjoshi8525]

One of the Best channels for dsa 💯

[@codestorywithMIK]

Means a lot 😇❤️🙏

[@PiyushSingh-xg4mc]

maza aa gya 👌👌

[@aws_handles]

what a fantastic explanation. you are a magician.

[@sjxsubham...]

nice❤

[@anushkathakur6531]

Thankyou so much....I thought it would require DP....really you made it so easy🥰

[@umeshbisht1054]

Thanku bhaiya ❤

[@lofireverbz-wy7go]

bhaiya really jo dry run krte ho na mja hi aajata hai

[@thekindspill]

you are just amazing. Can't believe Hard Qns seem easy.

[@codeandtalk6]

❤❤❤

[@harsitsinha1079]

that i at 5:37 is so perfect

[@HemantYadav-yp9zi]

Please make videos of the questions of contest after the contest sir.

[@AyushKumar-ty4cl]

Please cover 3rd question of weekly contest also. Lc 2962

[@gautamkumarshah1129]

sir plese make vedio on biweekly last question of yesterday you are great sir

[@ms2623]

Hi . Thanks for your amazing video . I think instead of making video for every leetcode POTD you can make videos on only medium - hard POTDs and then of the contest's medium-hard problems.

[@codestorywithMIK]

Means a lot. Thank you so much for your precious suggestions. Sure let me check the possibility. Sounds fair to me also 😇🙏

[@SauravRaj-z5x]

sir please upload the solution of find the closest palindrome leetcode 564

[@mahendrapratapsingh7335]

Bhaiya book allocation jaisa hai

[@techie5345]

@2:32 Why not [3,2] [1,1] is allowed?

[@deepaksingh-qd7xm]

isn't is same as doing pow(2, n-1) where n is number of groups???

[@dayashankarlakhotia4943]

public int numberOfGoodPartitions (int[]nums){ int ans=1,n=nums.length,mod=1000000007; Maplast=new HashMap(); for(int i=0;i