Learn
Practice
Interview
Resources
Newsletter
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Reorganize String
Bookmark
Sorting
Max Heap
Index Filling
Input
Example 1
Example 2 (Impossible)
Example 3
Custom
s
=
aab
input
a
a
b
input
a
a
b
input
a
a
b
frequency
a
1
input
a
a
b
frequency
a
2
input
a
a
b
frequency
a
2
b
1
input
a
a
b
frequency
a
2
b
1
input
a
a
b
frequency
a
2
b
1
max 'a' = 2 ≤ ⌈3/2⌉ = 2
✓
input
a
a
b
frequency
a
2
b
1
max 'a' = 2 ≤ ⌈3/2⌉ = 2
result
0
1
2
input
a
a
b
frequency
a
2
b
1
max 'a' = 2 ≤ ⌈3/2⌉ = 2
result
a
0
1
a
2
index
input
a
a
b
frequency
a
2
b
1
max 'a' = 2 ≤ ⌈3/2⌉ = 2
result
a
0
b
1
a
2
index
input
a
a
b
frequency
a
2
b
1
result
a
0
b
1
a
2
return "aba"
algo
master
.
io
Step:
Reorganize the string so no two adjacent characters match
0 / 18
Input
Example 1
Example 2 (Impossible)
Example 3
Custom
s
=
aab
0 / 18
algo
master
.
io
Step:
Reorganize the string so no two adjacent characters match
