Least Number of Unique Integers after K Removal - Leetcode 1481 - Python

🚀 neetcode.io/ - A better way to prepare for Coding Interviews
🧑‍💼 LinkedIn: / navdeep-singh-3aaa14161
🐦 Twitter: / neetcode1
⭐ BLIND-75 PLAYLIST: • Two Sum - Leetcode 1 -...
Problem Link: leetcode.com/problems/least-n...
0:00 - Read the problem
0:22 - Drawing Explanation 1
6:33 - Coding Explanation 1
8:56 - Drawing Explanation 2
13:53 - Coding Explanation 2
leetcode 1481
#neetcode #leetcode #python

[@dumbfailurekms]

I used the bucket sort approach you taught us in Top K frequent elements. I'm going to analyze the time complexity of mine then watch your video but thanks for being such a great teacher. I learned (and will continue to learn) so much from you. I used to be so clueless. Thank youu

[@barnetthan9391]

me too!

[@akshayiithyd]

I love the fact that even if I am able to solve the question, I almost always get something useful from Neetcode's solution, somedays It is the optimized approach, and on the other it is better code quality.

[@KhyatiSatija]

so impressive, thanks a lot sir

[@armandomendivil1117]

I solved it using bucket sort too!!

[@poketopa1234]

Great video, thank you

[@kirillzlobin7135]

Amazing

[@skguravana703]

Today I am happy that I have solved this by myself🎉

[@Aditya_qwertyu]

congrarts

[@Moch117]

Seemed like a greedy and sorting problem

[@marthimallikarjun5427]

Can someone explain the logical mistake in my code class Solution: def findLeastNumOfUniqueInts(self, arr: List[int], k: int) -> int: count = Counter(arr) arr.sort(key=lambda x: count[x], reverse=True) n = len(arr) return len(set(arr[:n - k])) please...!!

[@jts3077]

add arr.sort() before sorting by the count. This is because even though you sorted by count, the numbers with the same count can appear in any order. For instance, [1,1,2,2] could get sorted to [1,2,1,2] because 1 and 2 have the same count.

[@marthimallikarjun5427]

Thanks bro! U saved my streak

[@Sam-nc6xt]

You could also do this - arr.sort(key=lambda x: (count[x], x), reverse=True) It will first sort by freq and then by value which will fix the order as well