Longest subarray with sum divisible by K | GfG problem of the day

[@probabilitycodingisfunis1]

unordered_mapm;
int ans = 0;

m.insert({0,-1});
int sum = 0;
for(int i=0;i

[@mathematics6199]

Didi, one best optmization that we can use is, maintain a vector of pairs of the prefix sum remainders and sort them. This is much useful because worst case complexity of unordered map is worser than the cost of sorting. And also hash map is much wastage of memory.

[@joya9785]

@@mathematics6199 can you please explain it?

[@mathematics6199]

@@joya9785 thats what I did na?

[@joya9785]

@@mathematics6199 I mean if u have the sample code

[@mathematics6199]

@@joya9785 haa okk

[@krishnaradhey2814]

Literally I have seen many videos but have not got such clear explanation like you did here!!

[@dheerajkumar824]

it doesn't need extra 'n' complexity for sum (in brute force approach), it can be done within 'n^2' itself. Though it was further optimized.

[@themarketverse]

Nicely explained...You make these problems so easy...

[@probabilitycodingisfunis1]

Thank you so much!

[@inthearts4525]

what an explanation... just awesome.. saw a lot of videos but such a great explanation was missing... subscribing you and looking forward for many more amazing and crystal clear explanations..

[@karma_kar9623]

Can you solve competitive programing problems also i.e. codeforces? Your explanations are just phenomenal.

[@gautamjangir8927]

The best explanation in the entire youtube ....THANKS

[@shanayagupta4002]

di your explanation is very good. Thank u for delivering such quality content 😊😊😊😊

[@probabilitycodingisfunis1]

Thank you so much Nisha

[@lilyren7256]

awwww you are back! plz make more videos!!! And can you make a video to share how you start solving programming problems and what courses you have taken🥺🥺

[@probabilitycodingisfunis1]

❤❤❤Thank you Lily... Will try to make more videos, i just started Leetcode easy problems and moved to medium, I had taken GeeksforGeeks live DSA course

[@zishan53]

It's wonderful and nice explanation ...I seen various platforms videos but u among 🔥

[@Madhu__06]

amazing ... easy to understand . thank you.

[@notskinner2304]

Hard to come up with this in an interview ; I would be stuck after calculating prefix sum and would be confused how to do it using two pointers :(

[@gizmogaurav]

You make the problem so easy. Thanks 👍

[@gigachad2419]

Do You Solve And Explain only LeetCode+GFG Or even CP Questions from CodeChef/Forces?

[@joe0212]

Awesome. Can be slow. And, also can conclude by going through the logic once again.

[@AnuragYadav-nj2zc]

Great explanation !!!

[@rrrhitk]

literally the best explanation🔥

[@vivekpaliwal1876]

Good explanation
Keep it up, your channel has great future

[@chakravarty-with-a-v]

Great Explanation! Thanks a Lot!

[@sristysingh2175]

glad to see you back❤❤

[@probabilitycodingisfunis1]

Thank you so much ❤️❤️❤️

[@mayankshekhar4754]

well explained

[@Rajat_maurya]

Thank you

[@samajayadeepu3476]

well understood thanks

[@abhisheknair5630]

Thank you very much

[@reshmaparveen6679]

🎉🎉 nic explain madam

[@TheElevatedGuy]

Thank you di

[@Shadow-lx9rh]

Thank you again I'm able to solve this question and another question in leetcode which askd to count the number of subarray sum divisible by k (974)
I just had to count the number of places where previously the remainder had occurred
Thank yooooo soo much the way you explained -ve remainder concept and the whole problem was just marvelous.
Thank you from the core of my heart. 🙏

[@probabilitycodingisfunis1]

Thabn tou so much @Nightbird ..glad you found it helpful

[@Shadow-lx9rh]

🙇🙏

[@KrishnaKumar-b4m9p]

@@Shadow-lx9rh u need to count the no.of times where previously remainder has occured in the map.

[@alishabeautyparlour6283]

👍🏻

[@meandpenguinvlogs8221]

💯💯

[@vikasviplav8678]

got the logic but not understanding the implementation, better to implement on its own @codewithalisa

[@chestupheadup7410]

well explained