Least Number of Unique Integers after K Removals | 3 Approaches | Greedy | Leetcode 1481

[@EB-ot8uu]

I subscribed to your channel few days back and till now I think you are one of the best tutors I found on youtube for DSA. god bless you and thank you for covering all approaches.

[@codestorywithMIK]

✨ Timelines✨ 00:00 - Introduction 0:18 - Problem Explanation 5:52 - Approach-1 Intuition 9:10 - Time and Space Complexity of Approach-1 9:58 - Important Note 12:51 - Coding Approach-1 14:50 - Approach-2 Explanation 16:39 - Time and Space Complexity of Approach-2 17:52 - Coding Approach-2 19:41 - Approach-3 Detailed Explanation 39:45 - Coding Approach-3

[@oqant0424]

Using your story--> code method , I solved it on my own Came here to see a better approach ❤❤

[@Ankitkumar-fz3kc]

Thanks for 3rd approach it's very difficult to come up with it but you made easy thanks.

[@wearevacationuncoverers]

Nailed the 3rd Approach. Thanks a lot man. You always mesmerise me.

[@aws_handles]

I am a big fan of your explanation. Every time i learn something new. Thanks a lot for the 3rd approach

[@gui-codes]

Awesome explanation

[@ishwarreddy8820]

bhaiya aise hi guide karte rahiye boht help hota hai

[@thekindspill]

Was waiting for your upload, thank you mik❤️

[@utkarshsahay9908]

class Solution { public: int findLeastNumOfUniqueInts(vector& arr, int k) { unordered_map mpp; for(int num : arr) mpp[num]++; vector vec; for(auto it : mpp) vec.push_back(it); sort(vec.begin(),vec.end(),[] (auto a,auto b){ return a.second < b.second; }); int ans = vec.size(); for(auto &it : vec){ if(k >= it.second){ k -= it.second; } else if(k < it.second || k == 0){ break; } ans--; } return ans; } };❤❤

[@revolverlim.6444]

just a suggestion give the similar qus as hw at the end and link of the similar question in the github

[@codestorywithMIK]

sure thing.

[@parthbhatti4151]

@@codestorywithMIK yes please 🙏

[@bhuppidhamii]

yes

[@devmadaan5146]

No please no,😢

[@rohitshah8904]

Awesome explanation ❤ One doubt .. why k

[@bitandutta3151]

Thank you mik ❤

[@tutuimam3381]

Thanks a lot

[@divyamdubey9333]

Bro video tags would be really helpful

[@codestorywithMIK]

Sure thing Divyam. ✨ Timelines✨ 00:00 - Introduction 0:18 - Problem Explanation 5:52 - Approach-1 Intuition 9:10 - Time and Space Complexity of Approach-1 9:58 - Important Note 12:51 - Coding Approach-1 14:50 - Approach-2 Explanation 16:39 - Time and Space Complexity of Approach-2 17:52 - Coding Approach-2 19:41 - Approach-3 Detailed Explanation 39:45 - Coding Approach-3

[@dipesh5293]

awsome

[@oqant0424]

Thanks bhaiya :)

[@AmanKumar-qz4jz]

why only 18k subs.....man deserves lot more!!! guys please subscribe

[@jagadeeshp1163]

d={} for i in arr: d[i]=d.get(i,0)+1 count=len(d) arr.sort(key=lambda x:d[x]) cnt=0 for i in arr: cnt+=d[i] for i in range(k): t=arr.pop(0) d[t]-=1 if d[t]==0: count-=1 return count why is my code failing cases ?

[@maritime_business]

3rd approach toh interview ke time pe koi strike kar hi nhi paega, specially agar kisi ne phle se na kia ho there is no point in that specially that divide logic and then taking minimum, its too complicated :/

[@AryanAryan-ks5ib]

Hello sir hello can I get the greedy playlist mujhe mili ni and also can u build the discord server it will be helpful haha

[@AryanAryan-ks5ib]

Edit: sorry I got the playlist bt what about the discord server

[@oqant0424]

can anyone explain this part if(k

[@codestorywithMIK]

current frequency is freq further in for loop, we will be getting higher frequency because with every loop we are doing freq++ in the for loop. Now, suppose we reach a point where k

[@saurabhKumar-hj6yp]

❤❤

[@shabananoor9423]

❤❤

[@parththakkar6401]

class Solution { public: int findLeastNumOfUniqueInts(vector& arr, int k) { mapmp; for(int i=0;i

[@mursalinhawlader6407]

class Solution { public: int findLeastNumOfUniqueInts(vector& arr, int k) { mapmp; for(int i=0;isecond); } sort(v.begin(),v.end()); int i=0; while(i=k){ int x=abs(v[i]-k); v[i]=x; k=0; } else{ int x=abs(k-v[i]); k=x; v[i]=0; } i++; } int c=0; for(int i=0;i0)c++; } return c; } };

[@manimanohar_001]

First view

[@dayashankarlakhotia4943]

public int findLeastNumOfUniqueInts(int[]arr,int k){ Mapmpp=new HashMap(); for(int i:arr) mpp.merge(I,1,Integer::sum); PriorityQueuepq=new PriorityQueue(mpp.values()); while(k>0) k-=pq.poll(); return pq.size()+(k