philosyang.com

347. Top K Frequent Elements

prep work before final round.


1class Solution:
2    def topKFrequent(self, nums: List[int], k: int) -> List[int]:
3        count = Counter(nums)
4        freq = sorted([(cnt, num) for num, cnt in count.items()])
5        result = []
6        for i in range(1, k + 1):
7            result.append(freq[-i][1])
8        return result

#Neetcode150 #Array #Hashing #Python