Subarrays with distinct integers

[@phantom3612]

A note to myself (CPP implementation) //WHY WE NEED THIS HELPER() fn AGAIN //When you notice, //We HAVE to find exactly k distinct vals //We know atmost one is easier. //Doing Atmost Technique (k (-) k-1) //we get to our answer efficiently //As for counting total no of subarr //why we doing count += (j-i+1) ? //cuz if we do a dry run, we observe this only #include int helper(vector&arr, int n, int k){ //This is basically //finding total subarr with atmost k distinct int unordered_map mp; int i=0, j=0, count=0; while(j

[@muditkhandelwal2008]

I watched neetcode video but couldn't understand the solution. This video saved the day. Thanks.

[@amanjain6643]

This is one of the clearest and most detailed explanations for this problem. Kudos to you Alisa.

[@dasaridharani6529]

True

[@piragna5802]

I hav reached minute 1:42 and I am alreazy amazed because of the expalantion, thank you su much! you´re amazing!

[@piragna5802]

😊

[@Yash6189]

Alisha, good work, you're the only one who not only describes the intuition but also explains why and how it works! 💯

[@PRINCEKUMAR-ml9tb]

Just Phenomenal! One of the best explanation of this problem.

[@kusumjoshi4613]

This is one of the best explanations I have seen soo far.

[@krishnasingh2520]

Brilliant explanation Ma'am. I was stuck on this Question for a while but the way you dry ran the code helped me understand the code. And i was able to code it myself🙏🏽⭐

[@technologicalvivek7510]

Nice explanation.Thank you didi .I got stuff to solve this question.After spending a lot of time.Thanks finally I understand the correct approach behind this question.

[@Anuragkumar-dc1dr]

what an explanation! you have solved problem logically. And also understand concept behind writing every line of code . Thank You Alisha

[@shashankbankar1845]

God level explained , I simply can't thank you enough, please continue making such videos, you are awesome..

[@omkarkawatgi]

Yar ye hota hai explanation... bahut sahi ! Thank you ...

[@mrinalmadhav8119]

Mam u r beauty with brain

[@Inndjkaawed2922]

WTF dude?

[@ShardulPrabhu]

Sudhar ja padhai kr

[@rutikdeshmukh9373]

wowww, very intutive technique and detailed explanation!! thanks

[@gowrisankar98jammu49]

Awesome explanation 👏 👌 👍

[@preethi9087]

mam ur explanation is awesome .thank u

[@awesomesheen]

Amazing intuition! Best video on this question I have seen!

[@saketmehta6697]

One of the best explanation for this hard problem! Watch this video guys you'll be able to solve many problems of sliding window! Kudos alisha! Hats OFF!

[@rachakondaeshwar4129]

Beautiful explanation.

[@Sanjaysview]

Yo, that was smooth explanation. Thanks Sister!!

[@sukhpreetsingh5200]

Awesome explaination

[@sujayshanbhag2055]

Best explanation ever.

[@manishisaxena5657]

bhut pyara samjhaya hai aapne thankyou.

[@niteshgupta1118]

Amazing explanation. Was struggling on this question from so many hours.

[@PiyushKatare-z6u]

great explanation

[@Komedy1Reels]

wooow, in leetcode this question is marked as hard, i spent whole day to figure out how to solve this but i failed, after seeing your approach, i felt like this is "this one so simple", Thank you so much for the vd and ur explanation is really good, I am gonn post this vd on leetcode😅

[@souviknandi9298]

Thank you🙇‍♂ The most under rated youtuber.

[@soumyajitmishra6855]

Thank you ... beautifully explained

[@RassieVanderDussen-mc8um]

Very Good Explanation

[@itsaryanb9316]

perfectly explained, thank you :)

[@anuragtiwari3032]

Came for 1 question learnt 2. Excellent work , wish ur channel to explode 🔥

[@sahnawazshaban1234]

superb explanation; keep growing😊

[@yaswanthkosuru]

you r time taken to solve 72 min i think i am only one who take 2 hrs ,3 hrs to slove problems

[@IndieDeveloperGuy]

Thankyou so much , i was stuck on this question for a really long time.

[@ameygadhe6437]

Damn girl you smart.

[@ursawarior4ever]

wow watched two other videos that made no sense and now i get it, THANK YOU

[@mitrraaswin4933]

Great explanation madam! And I got this exact question from an interview. I was able to explain the logic but getting the code run in O(n) complexity wasn't easy for me. But informative video as always

[@pragneshamadavadi2267]

GEM 🔥🔥

[@NaveenKumar-os8dv]

I know you don't have many subscribers and views, but your explanation is great, whenever I am stuck at some point, you come as an angel to resolve my query. Keep doing this. There is just one problem, this code is at faster than 5% ( more than 100 ms) in leetcode. which means it is slow for some reason. Some other solution without the MAP (and only new arr[n+1]) runs faster. (faster than 90%) 4 to 10 ms run. Can you please make video for that method too, please....I want to really understand, but I am unable too, please make video on it.

[@probabilitycodingisfunis1]

I appreciate that! Thanks

[@chintanpatel9304]

Nice explanation. Thanks for the solution

[@prasantdas7182]

Great explanation🔥

[@soumakdalapati2026]

thanks for the video....great explanation !!!..🙏🙏

[@sunilbhenspaliya9931]

simple and best explained .thank you so much alisha

[@probabilitycodingisfunis1]

Glad it was helpful!

[@mihirsagar2715]

This is GOD level explanation

[@pranshuadhwaryu6374]

Alisha dii keep going 💪🔥

[@OMPRAKASH-fh3so]

Nice Explanation.

[@gremlan6419]

Nice explanation

[@kmanju6854]

Perfect explanation

[@asjadahmedkhan9661]

Just Amazing !!! The expiation is very very good!!. Keep up the good work.

[@mahimahesh5094]

Thank you alisa

[@priyankamishra5704]

Well explained! finally understood the logic.

[@rankitgujjar80]

crystal clear explanation as always 🙇‍♂🙇‍♂

[@mohitkumar557]

very easy logic to understand

[@guptagaurav916]

The easiest to interpret. Thank you !

[@ranitdey7369]

Really amazing explanation. Awesome ❤️!

[@manup7636]

Beauty with brains.

[@digambardiwakar9535]

thankyou so much

[@vermadeepak84]

what about finding all subarrays with unique elements? i.e., with no threshold

[@tarunmali6228]

Great explanation!!!

[@ShadabKhan-o2u]

Best

[@atchaiyarajsaravanan]

amazing video! please change the title to "subarrays with k distinct integers"

[@Nitishkumar-rd4jq]

the answer i am waiting looking for!!!!!!!

[@karthik4061]

Great work Keep going!!! :)

[@AayushDubey_007]

In gfg , my Test Cases are stuck at 11024 /11027 or 11026/11027 (TLE) , what optimisation can be done?

[@vamshisamineniz5905]

good explanation

[@probabilitycodingisfunis1]

Thank you so much

[@cricketsureshlucky]

mam please explain me when we are counting subarrays 1 is counted twice 1 at index 0 with size one and 1 at index 3 with size 1 at 4:30

[@arunmurukesh2830]

Good job ma...

[@fpol890]

Hello, do you offer tutoring by any chance?

[@GoluYadav-cg3kx]

isn't it expensive to use erase method for map, we can take an integer to keep track of unique elements

[@franciskp9117]

Seeing all those tabs....my laptop just stopped working

[@saktagan28]

like and subscription) I have question what is the name of the formula -> exactly(K) = atMost(K) - atMost(K-1) and where I can read about it more, cause I can not find it in internet Thanks)

[@mathematics6199]

Dude, in atmost K, you will get this expression write-> exactly(1) + exactly(2) + ..... exactly(k), similarly for atmost (k-1) you will get exactly(1) + exactly (2) + .... exactly (k-1) just subtract these two. you will get exactly(k). Now don't ask why atmost k expression is the above expression.

[@CodingNinja-f7k]

what if the value of k=1

[@RohitKumar-dy2gc]

so easy i code by myself

[@deeprealanalysis1407]

provide code as well

[@vaibhavverma1340]

please solve this using python !!

[@nikunjgupta2878]

your code fail when value of k==1

[@md.sahidulislam3152]

//where is the wrong...please help me unordered_mapmp; int n=nums.size(); int i=0,count=0; for(int j=0; jk){ mp[nums[i]]--; if(mp[nums[i]]==0){ mp.erase(nums[i]); } i++; } count +=(j-i+1); } return count;

[@RishikeshPandaFeels]

Twitter?

[@ShootOniPhone914]

perfect solution mam

[@satyamjha-codeindwala6666]

[@ishansrivastava598]

hey i the way hello guys today in 2x

[@rahuljain224]

Nice explanation

[@md.hasanmahmud1390]

good explanation

[@satyamjha-codeindwala6666]