DSA Visualizer · 25 visualizationsTop K Frequent Elements
MediumArrays & Hashing
Top K Frequent Elements
Given an integer array nums and an integer k, return the k most frequent elements. You may return the answer in any order.
The step-through player is coming for this one. Two Sum has the full animation today; the rest are being authored in the admin.
Pythontime O(n) · space O(n)
def topKFrequent(nums: list[int], k: int) -> list[int]:
from collections import Counter
count = Counter(nums)
bucket = [[] for _ in range(len(nums) + 1)]
for num, freq in count.items():
bucket[freq].append(num)
res = []
for i in range(len(bucket) - 1, 0, -1):
for num in bucket[i]:
res.append(num)
if len(res) == k: return resNext upProduct of Array Except Self
Two Sum is free. Enroll to unlock every visualization and save where you stopped.Enroll free
Watch the video walkthrough