Learn
Practice
Newsletter
Resources
Mobile
New
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Top K Frequent Elements
Bookmark
Input
Example 1
Example 2
Example 3
Custom
nums
=
[1, 1, 1, 2, 2, 3]
,
k
=
2
Input Array:
1
1
1
2
2
3
Min-Heap (size ≤ k):
(empty)
Input Array:
1
1
1
2
2
3
Min-Heap (size ≤ k):
(empty)
Input Array:
1
1
1
2
2
3
curr
Frequency Map:
1:1
Min-Heap (size ≤ k):
(empty)
Input Array:
1
1
1
2
2
3
curr
Frequency Map:
1:3
Min-Heap (size ≤ k):
(empty)
Input Array:
1
1
1
2
2
3
curr
Frequency Map:
1:3
2:1
Min-Heap (size ≤ k):
(empty)
Input Array:
1
1
1
2
2
3
curr
Frequency Map:
1:3
2:2
3:1
Min-Heap (size ≤ k):
(empty)
Input Array:
1
1
1
2
2
3
Frequency Map:
1:3
2:2
3:1
Min-Heap (size ≤ k):
1:3
Input Array:
1
1
1
2
2
3
Frequency Map:
1:3
2:2
3:1
Min-Heap (size ≤ k):
3:1
1:3
2:2
Input Array:
1
1
1
2
2
3
Frequency Map:
1:3
2:2
3:1
Min-Heap (size ≤ k):
L
2:2
1:3
Input Array:
1
1
1
2
2
3
Frequency Map:
1:3
2:2
3:1
Min-Heap (size ≤ k):
1:3
Top K Frequent Elements:
2
Input Array:
1
1
1
2
2
3
Frequency Map:
1:3
2:2
3:1
Min-Heap (size ≤ k):
(empty)
Top K Frequent Elements:
2
1
algo
master
.
io
Step:
Start: Find top k frequent elements using hashmap and min-heap
0 / 16
Input
Example 1
Example 2
Example 3
Custom
nums
=
[1, 1, 1, 2, 2, 3]
,
k
=
2
0 / 16
algo
master
.
io
Step:
Start: Find top k frequent elements using hashmap and min-heap
