Learn
Practice
Interview
Resources
Newsletter
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Sort Characters By Frequency
Bookmark
Sorting
Max-Heap
Bucket Sort
Input
Example 1
Example 2
Example 3
Custom
s
=
tree
INPUT STRING
t
r
e
e
sort the characters by frequency
INPUT STRING
t
r
e
e
sort the characters by frequency
INPUT STRING
t
r
e
e
count how often each character appears
INPUT STRING
t
r
e
e
curr
FREQUENCY MAP
t
:
1
count '
t
' →
1
INPUT STRING
t
r
e
e
curr
FREQUENCY MAP
t
:
1
r
:
1
e
:
1
count '
e
' →
1
INPUT STRING
t
r
e
e
curr
FREQUENCY MAP
t
:
1
r
:
1
e
:
2
count '
e
' →
2
INPUT STRING
t
r
e
e
FREQUENCY MAP
t
:
1
r
:
1
e
:
2
SORTED BY COUNT (highest first)
e
:
2
t
:
1
r
:
1
sort the distinct characters by
count
, descending
INPUT STRING
t
r
e
e
FREQUENCY MAP
t
:
1
r
:
1
e
:
2
SORTED BY COUNT (highest first)
e
:
2
t
:
1
r
:
1
RESULT
write each character out as many times as it occurred
INPUT STRING
t
r
e
e
FREQUENCY MAP
t
:
1
r
:
1
e
:
2
SORTED BY COUNT (highest first)
e
:
2
t
:
1
r
:
1
RESULT
e
e
t
append '
t
' ×
1
→ "eet"
INPUT STRING
t
r
e
e
FREQUENCY MAP
t
:
1
r
:
1
e
:
2
SORTED BY COUNT (highest first)
e
:
2
t
:
1
r
:
1
RESULT
e
e
t
r
append '
r
' ×
1
→ "eetr"
INPUT STRING
t
r
e
e
FREQUENCY MAP
t
:
1
r
:
1
e
:
2
SORTED BY COUNT (highest first)
e
:
2
t
:
1
r
:
1
RESULT
e
e
t
r
result = "eetr"
algo
master
.
io
Step:
Sort characters by frequency by sorting the distinct characters
0 / 11
Input
Example 1
Example 2
Example 3
Custom
s
=
tree
0 / 11
algo
master
.
io
Step:
Sort characters by frequency by sorting the distinct characters
