TOP k or Kth

347. Top K Frequent Elements

https://leetcode.com/problems/top-k-frequent-elements/

class Solution:
    def topKFrequent(self, nums: List[int], k: int) -> List[int]:
        cnt = collections.Counter(nums)
        return heapq.nlargest(k, cnt.keys(), key=cnt.get)