Learn
Practice
Interview
Resources
Newsletter
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Top K Frequent Elements
Bookmark
Sorting
Min-Heap
Bucket Sort
Input
Example 1
Example 2
Example 3
Custom
nums
=
[1, 1, 1, 2, 2, 3]
,
k
=
2
nums
1
1
1
2
2
3
0
1
2
3
4
5
nums
1
1
1
2
2
3
0
1
2
3
4
5
nums
1
1
1
2
2
3
0
1
2
3
4
5
nums
1
1
1
2
2
3
0
1
2
3
4
5
curr
value : count, sorted by count
1:1
nums
1
1
1
2
2
3
0
1
2
3
4
5
curr
value : count, sorted by count
1:3
nums
1
1
1
2
2
3
0
1
2
3
4
5
curr
value : count, sorted by count
1:3
2:1
nums
1
1
1
2
2
3
0
1
2
3
4
5
curr
value : count, sorted by count
1:3
2:2
nums
1
1
1
2
2
3
0
1
2
3
4
5
curr
value : count, sorted by count
1:3
2:2
3:1
nums
1
1
1
2
2
3
0
1
2
3
4
5
value : count, sorted by count
1:3
2:2
3:1
top k
1
nums
1
1
1
2
2
3
0
1
2
3
4
5
value : count, sorted by count
1:3
2:2
3:1
top k
1
2
nums
1
1
1
2
2
3
0
1
2
3
4
5
value : count, sorted by count
1:3
2:2
3:1
top k
1
2
algo
master
.
io
Step:
Start: count every value, then sort by frequency
0 / 11
Input
Example 1
Example 2
Example 3
Custom
nums
=
[1, 1, 1, 2, 2, 3]
,
k
=
2
0 / 11
algo
master
.
io
Step:
Start: count every value, then sort by frequency
