Top K Frequent Elements

Heap-based solution to retrieve the k most frequent integers.

O(1)

Low confidence

Last analyzed Sep 12, 2025

Python

Algorithms

Data Structures

Authored by Casey Liu*Jun 4, 2025

Code

PYTHONSnippet preview

1import heapq
2from collections import Counter
3
4
5def top_k_frequent(nums: list[int], k: int) -> list[int]:
6    counts = Counter(nums)
7    heap = [(-freq, value) for value, freq in counts.items()]
8    heapq.heapify(heap)
9    return [heapq.heappop(heap)[1] for _ in range(min(k, len(heap)))]

Loading snippet preview...

Complexity explanation

No loops, recursion, or data-dependent operations detected.

Signals detected

No loops
No recursion