Subarray Sums Divisible by K | Brute Force | Optimal | Easy Explanation | codestorywithMIK

[@varunyadav6560]

Best video on youtube to understand the concept of this question..Thank you so much brother 💖

[@codestorywithMIK]

Thank you so much Varun ❤️❤️❤️

[@thexzavier8283]

Bruv don't stop uploading you are gonna get that 1M in no time, the way you explained all the mathematical stuff was too good👍

[@codestorywithMIK]

Thanks a lot 😇❤️

[@rguktiiit371]

++

[@ramandeepsingh8464]

kya video hai bhiya OP 🙂lot a way better than all bhiya's & didi's here we are using the modulo property which is (a-b)%m = (a%m - b%m + m)%m

[@robot3.077]

Thanks

[@VivekPathak-ds2do]

You are the only one jo ye pahle batate ho ki socha kaise jata h. Fir prove krte ho. Yhi reason hai ki apki videos baki youtube videos se better hoti h. Or aapke concept dekhne k baad mere ko code dekhne ki need aaj tk nhi hui.

[@parth5183]

True, I rarely felt the need to see the code, once I saw his explanation

[@Momentsofmagic28]

True

[@pratik.784]

Aapke 1 million jald hoga 🤩

[@codestorywithMIK]

Tysm ❤️❤️❤️

[@souravjoshi2293]

Sach me yaar. This guy is on fire

[@tusharrajput983]

I don't care how many subscribers or views you have. But you always have the best way of explaining questions. this is absolute luxury to have all this for free.

[@sourav-bisht]

No one explains like you bro You are the best

[@adhikari669]

Bhaya aisa content pure KZbin m khi ni h, na hi aisi awaj ❤️

[@LifeYetLive]

Bhai maja aa gya ❤ itna acche sai toh kisi ne nai samjya abhi tak

[@CodingGuru92]

I am a huge fan of your teaching style. I have leaned DP also from your videos. You are doing a great job. Keep it up 👍.

[@rahulpandey5094]

best way of explaining I have ever seen . Thank you so much sir .🙏

[@codestorywithMIK]

So nice of you. Thank you so much for watching 😇🙏

[@venkatarohitpotnuru38]

corner case is just lit🔥

[@himanshusharma9132]

Bruteforce approach - O(n3) passed 70/73 testcases Bruteforce approach with O(1) sum testcase passed 69/73 testcases Thanks Bhaiya , your approach always improves my logic building skills

[@drbullah1388]

Probably the best channel for learning the concept rather than the code Bhaiya confidence hai ki agar aapke saath daily LeetCode problems karte raha to kuch hi dino me pura pura khud se solve kar paunga Thanks for being there on youtube sharing all your knowledge

[@codestorywithMIK]

I am so glad to hear that. And indeed we all will grow together 💪

[@shobhitsharma2137]

Bro your explanation is so good that I can’t even imagine how you could have been able do this

[@codestorywithMIK]

🙏🙏❤️❤️

[@akmarkan2490]

Insane my brother⚔️⚔️🥵

[@ece39pranshupatel71]

Thank you so much bhaiya..best explanation for modulo concept 💥❤️

[@nagmakhan3165]

The best explanation on KZbin for this video

[@yashika6248]

After trying so hard to grasp the concept, I finally came across this video and now I am thankful

[@nileshdeshmukh7841]

Make daily videos bhaiya , it will help me to crack companies , my interview is scheduled and if I watch your video daily , i will definetly crack good companies , bcoz same I will going to explain in Interview starts from brute force to optimised. please keep uploading video daily !

[@codestorywithMIK]

Sure All the very best

[@atifhu]

every time I am stuck in the ques, I know MIK is there for me❤🙌

[@codestorywithMIK]

Tysm Atifhu 💓

[@AbhayGupta-oz1ix]

Two amazing concepts : 1,2,3.....n.......m 1) Sumtill(n) % k == Sumtill(m) % k means Sum(n...m) is divisible by k. Got it Thanks to sir. 2) mod = num % k ; if (mod < 0) mod = k - mod // the edge case

[@gui-codes]

Kya mast samjhate ho bhai. love you bhai Better than any video present on this problem on youtube

[@souravjoshi2293]

And the PERFECTION is here

[@rockykumarverma980]

Thank you so much Bhaiya ji 🙏🙏🙏

[@pradyumnmulegaon385]

i appreciate the depth of explanation that you have given in this video🔥🔥

[@kalp2586]

Amazing explanation.

[@kumarimegha9187]

Literally i have no words for this video....your explanation is awesome.... thankyou so much 💖

[@_jaydip74]

Hey Brother , I watch your videos daily and I just want to tell you that You are doing great work . Keep it up 🤗 . Love From Gujarat ❣. Thank you for the daily videos. 🙌

[@codestorywithMIK]

Thanks a lot Jaydip ❤️❤️❤️

[@jaygala6699]

great explanation!!! keep making these videos 👍👍

[@codestorywithMIK]

Tysm Jay ❤️❤️❤️

[@Sachin_Alam]

Thanks a ton for the Cumulative sum approach.

[@codestorywithMIK]

Happy to help ❤️

[@OtakRajCodes]

wonderful explanation as always . Your method of first proving why the concept/technique works and then implementing it is awesome!! keep up the good work :)

[@codestorywithMIK]

Tysm ❤️❤️❤️

[@thecricketerraja]

ur level of explanation 💥, tnku soo much bhai ❤

[@codestorywithMIK]

Thank you so much ❤️😇🙏

[@tusharrajput983]

for anyone wondering about the school division concept : In modular arithmetic, the remainder is always a non-negative number less than the divisor. So (-4 % 7 would be = 3). you are thinking right. but In C++ (idk about other languages), the modulus operation with a negative dividend retains the sign of the dividend. Therefore, when you compute -4 % 7, the result will be -4

[@College_era69]

kya GOD ho yar ap maja hi ajjata hai..i pick question from striver sheet and if smj ni atta to try finding ur soln ki kya apne same questn pe soln banaya hai if yes toh phle mai apka dkhta thnkeww mikkuu bhiayaaa love uu

[@codestorywithMIK]

🙏🙏🙏❤️❤️❤️

[@abhishek_jha28]

Absolutely wow explanation

[@raihanulalamhridoy4714]

A lot of effort was put into this video. Thank you for the explanation!

[@Shivanai_h]

Best explanation on youtube.. please keep uploading solution with awesome explanation like this:)

[@codestorywithMIK]

Thank you so much 😇❤️🙏

[@amangoyal1600]

Good Explained 😊

[@chaitanyakarthikbasva]

Awesome explanation, and you were right, only you explained the root reason behind everything in the approach, huge love from south india

[@codestorywithMIK]

So nice of you Thank you 🙏😇❤️

[@itsaayush7357]

Bro , your neat code, your clear voice explaination, and your pure intention to make us learn is just unmatchable! There are very few people at you tube jo itna shiddat se pdate he. Hatts off bro! Thank youuu🫂

[@codestorywithMIK]

Means a lot. Thank you so much 🙏🙏❤️❤️

[@divyasain15]

best explanation 🙌🙌

[@deeparawat8308]

Very nice and detailed approach✨ Very helpful! Thank you👍

[@AnandKumar-kz3ls]

the way you explain how to tackle with negative remainder is just awesome bro respect++

[@zhunzargulhane6741]

what awesome yaar, how did he considered 7n-4 that is still not clear. Could you please explain from where this n is coming.

[@Akash-yr2if]

Took around 1.5 hours to understand but finally it got inside my head, Thanks mate. Ye sum agar placement ka puch jarur batunga.

[@codestorywithMIK]

Thank you 😊 ❤️

[@udaytewary3809]

You are awesome bhaiya I already solve the question using the map but your explanation comes like cherry 🍒 on top and by that my understanding towards the question increases to 10 times and for that really thankyou bhaiya really thankyou

[@mewaconite]

big respect for you brother, good explanation, quality video ! please continue your DSA series as well.

[@kartikkk4583]

best video bro dayum

[@tangududwarika4243]

Insane explanation just subscribed the channel

[@codestorywithMIK]

Thank you so much 😇🙏❤️

[@tutuimam3381]

Thanks a lot 3 approaches 🔥🔥🔥

[@curtdudeanmol9393]

your channel is going to grow , best of luck , well explained

[@codestorywithMIK]

Thanks a lot Anmol ❤️

[@niteshk0487]

mind blowing brdr👌✅

[@priyanshkumar17]

Splendid Explanation Bhaiya !! Thanks & keep uploading such videos !! All the best to you😊😊😊😊🔥🔥

[@utkarsh9233]

wonderful explanation

[@codestorywithMIK]

Thank you 😇🙏

[@nisargbarot1998]

Bhai superb explaination!!!

[@pankajsuryavanshi8332]

Bro I am addicted to your channel Day by day.what a explanation brute force code explain then code submit then Explain TLE and again optimise approach.no one is teaching from that much depth

[@pankajsuryavanshi8332]

Bro u can make more views if u show java code as well like just see striver video.its suggestion

[@codestorywithMIK]

Sure Pankaj. I will try that too soon. Thanks a lot for your kind words

[@codestorywithMIK]

Sure Pankaj. I will try that too soon. Thanks a lot for your kind words

[@robot3.077]

means remainder is (sum%k+k)%k for both positive and negative

[@Music-tp8gg]

Next level explanation

[@shreyasharma7987]

You explain so well!!! Thanks a lot.

[@yashgaur2470]

Great Explanation sir!

[@codestorywithMIK]

It means a lot. Thank you 😇❤️

[@altafmazhar7762]

29:54 great job bro this is what we want

[@Akashkumar_12]

very good explanation thank you bhaiya

[@Faiyaz__Ansari]

Amazing explanation of concepts step by step! Literally the best on KZbin!! 1M zyada door nahi

[@codestorywithMIK]

Means a lot. Thank you so much 😇🙏

[@aftereffectstraining7668]

thank you! big fan of your explanation

[@kumarsaurabh5449]

always waiting for you video .best teacher in yt..😀😀😀

[@codestorywithMIK]

Thanks a lot Saurabh ❤️❤️❤️

[@lokeshgoswami3748]

best teacher ,

[@_hulk748]

Thankyou sir understood 🙇‍♂🙏❤

[@codestorywithMIK]

So glad to hear ❤️❤️❤️

[@TUSHARJAIN-gv4fi]

Great Work

[@ispyu1514]

Great explanation!

[@nikhilhaspe2734]

Hi Sir, Brute force will be of O(n^2) not O(n^3) as you said at 04:49 Code: class Solution { public int subarraysDivByK(int[] nums, int k) { int sum, count=0; for(int i=0; i

[@bhaktisharma9681]

thank you so much for this!!

[@JJ-tp2dd]

mza aa gya bhai..thanks

[@Bankruptcoder786]

thank you boss

[@AryanMishra-yh4ic]

well explained

[@shashankvashishtha4454]

moj karadi sir.

[@anubhavsingla3126]

I tried this approach in my first attempt void solve(vector& nums, int index, vector& temp) { if(index == nums.size()) return; vector ans; for(int i=index; i

[@NatureLover-oq6uc]

Nice explanation sirji.....its a request plzz try to make videos little short....you would see a lot increase in no. of views on your channel.....btw thanks

[@letsgazestar]

Hidden Gem .

[@dhairyachauhan6622]

A slightly better approach o(n2) whithout using prefix array the idea is to calculate the sum while building the subarrays class Solution { public: int subarraysDivByK(vector& nums, int k) { int n = nums.size(); int ans = 0; for(int i = 0;i

[@priyanshkumar17]

Yes, I also did the same

[@03_utpallucky40]

iska mtlb jahan bhi subarray ki bat ho aur k diya ho divisible jaisa kch modulo baba ki jai ho soch skte .Crrct me if i am wrong.

[@gauravbanerjee2898]

Thank you so much bhaiya ❤❤

[@inglevivek8351]

goat explanation

[@santoshpathak8201]

Please Provide a Video on KMP and Z-Algorithm . We will be thankful

[@codestorywithMIK]

KMP - kzbin.info/www/bejne/p5LWlqZjbsyCps0si=WDpG81RfsXWdXUX1

[@ravicharan6568]

Thanks a lot!

[@codestorywithMIK]

Thank you for watching 😇🙏

[@vaibhavjain709]

Good job man.

[@abhinay.k]

thanks

[@shabananoor9423]

3 ways 🔥🔥🔥

[@aws_handles]

This is lit 👌🏻👌🏻👌🏻

[@EB-ot8uu]

Best.

[@hackingkingdom5634]

Op Explanation sir

[@a3rdtierguy864]

Due to this negative remainder edge case i am unable to pass all testcases .

[@DevOpskagyaan]

Mast ❤

[@SatyamYadav-oz5ge]

bhaiya make videos on lc 401 and biweekly 132 (3rd and 4th one) dp

[@Momentsofmagic28]

Thanks a lot

[@molyoxide8358]

This line 29:53 shows your Patience level bro.

[@codestorywithMIK]

Thanks a lot ❤️

[@wearevacationuncoverers]

true

[@karthikeysharma9161]

🔥

[@pritishpattnaik4674]

mein pehele try kiya aur n^2 solution hi likh paya then saw ur video , awesome explanation sir!! My Approach int subarraysDivByK(vector& nums, int k) { //O(n^2) int ans = 0; for (int i=0 ; i

[@codestorywithMIK]

Thanks a lot Pritish. And I am so glad you tried O(n^2) on your own first. Way to go 💪💪💪

[@TusharRaja3009]

maine brute force try kia, usme kewal 70 testcase pass hua and then tle aya. Can you make a video about what are importance of constraints.. and how to decide that as per constraint which which O() or bigOmega will be accepted... becoz i thought that 10^8 cycle per second is allowed , and in question we had Constraint that n is within 3x10^4... so i thought 10^4 ka square means 10^8 tak toh chalna chahiye tha means O(n square) chalna chahiya tha but nahi chala ... plzzz ispe video banao na..explaining these complexities(sorry for typos)

[@Lakshya-f4l]

Thank you !

[@aizad786iqbal]

Hey MIK Longest subarray with sum divisible by K can u please make a video on this topic in your free time .. it should be based on similar logic right ?

[@dibbodas4116]

if remainder is negative why we adding k rather than any number? modulo + k wala part hard hea