1481. Least Number of Unique Integers after K Removals | Hash Map | Counting Sort

[@dhruvrawatt9]

Aryan you give so much positive vibes the way you speak and explain. Your are a GEM.

[@Sumeet_100]

Thank You So Much !!

[@sachinrelekar9509]

Bhaiya want should I choose IIIT Allahbad or NIT Allahbad?? I am having interest in coding.

[@omkumarjha2745]

Bhaiya can we solve the same with bucket sort ??

[@Algorithmswithsubham]

sir why this solution is wrong
mapmp;
for(auto it:arr)mp[it]++;
setst;
for(auto it :mp){
if(it.second

[@codencode5546]

Because map will not sort the freq. of Element it will sort the Key, and in your case key is "Element". So, in q. we've to remove the element whose freq. is less and so on.

[@AbhishekGupta-ik9ql]

Bro please start teaching in Hindi. Im requesting you again and again