Learn
Practice
Interview
Resources
Newsletter
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Maximum Number of Balloons
Bookmark
Frequency Array
Hash Map
Input
One balloon
Two balloons
'o' bottleneck
None
Custom
text
=
nlaebolko
n
l
a
e
b
o
l
k
o
balloon needs b·a·l·l·o·o·n — the scarcest letter caps the count
n
l
a
e
b
o
l
k
o
balloon needs b·a·l·l·o·o·n — the scarcest letter caps the count
i
n
l
a
e
b
o
l
k
o
freq[26]
0
a
0
b
0
c
0
d
0
e
0
f
0
g
0
h
0
i
0
j
0
k
0
l
0
m
1
n
0
o
0
p
0
q
0
r
0
s
0
t
0
u
0
v
0
w
0
x
0
y
0
z
b:
0
?
a:
0
?
l:
0
÷ 2
?
o:
0
÷ 2
?
n:
1
?
freq['
n
' - 'a'] += 1 →
1
i
n
l
a
e
b
o
l
k
o
freq[26]
1
a
0
b
0
c
0
d
0
e
0
f
0
g
0
h
0
i
0
j
0
k
1
l
0
m
1
n
0
o
0
p
0
q
0
r
0
s
0
t
0
u
0
v
0
w
0
x
0
y
0
z
b:
0
?
a:
1
?
l:
1
÷ 2
?
o:
0
÷ 2
?
n:
1
?
freq['
a
' - 'a'] += 1 →
1
i
n
l
a
e
b
o
l
k
o
freq[26]
1
a
0
b
0
c
0
d
1
e
0
f
0
g
0
h
0
i
0
j
0
k
1
l
0
m
1
n
0
o
0
p
0
q
0
r
0
s
0
t
0
u
0
v
0
w
0
x
0
y
0
z
b:
0
?
a:
1
?
l:
1
÷ 2
?
o:
0
÷ 2
?
n:
1
?
freq['
e
' - 'a'] += 1 →
1
not a balloon letter
i
n
l
a
e
b
o
l
k
o
freq[26]
1
a
1
b
0
c
0
d
1
e
0
f
0
g
0
h
0
i
0
j
0
k
1
l
0
m
1
n
1
o
0
p
0
q
0
r
0
s
0
t
0
u
0
v
0
w
0
x
0
y
0
z
b:
1
?
a:
1
?
l:
1
÷ 2
?
o:
1
÷ 2
?
n:
1
?
freq['
o
' - 'a'] += 1 →
1
i
n
l
a
e
b
o
l
k
o
freq[26]
1
a
1
b
0
c
0
d
1
e
0
f
0
g
0
h
0
i
0
j
1
k
2
l
0
m
1
n
1
o
0
p
0
q
0
r
0
s
0
t
0
u
0
v
0
w
0
x
0
y
0
z
b:
1
?
a:
1
?
l:
2
÷ 2
?
o:
1
÷ 2
?
n:
1
?
freq['
k
' - 'a'] += 1 →
1
not a balloon letter
n
l
a
e
b
o
l
k
o
freq[26]
1
a
1
b
0
c
0
d
1
e
0
f
0
g
0
h
0
i
0
j
1
k
2
l
0
m
1
n
2
o
0
p
0
q
0
r
0
s
0
t
0
u
0
v
0
w
0
x
0
y
0
z
b:
1
1
a:
1
?
l:
2
÷ 2
?
o:
2
÷ 2
?
n:
1
?
b
:
1
=
1
min so far 1
n
l
a
e
b
o
l
k
o
freq[26]
1
a
1
b
0
c
0
d
1
e
0
f
0
g
0
h
0
i
0
j
1
k
2
l
0
m
1
n
2
o
0
p
0
q
0
r
0
s
0
t
0
u
0
v
0
w
0
x
0
y
0
z
b:
1
1
a:
1
1
l:
2
÷ 2
?
o:
2
÷ 2
?
n:
1
?
a
:
1
=
1
min so far 1
n
l
a
e
b
o
l
k
o
freq[26]
1
a
1
b
0
c
0
d
1
e
0
f
0
g
0
h
0
i
0
j
1
k
2
l
0
m
1
n
2
o
0
p
0
q
0
r
0
s
0
t
0
u
0
v
0
w
0
x
0
y
0
z
b:
1
1
a:
1
1
l:
2
÷ 2
1
o:
2
÷ 2
1
n:
1
?
o
:
2
÷
2
=
1
min so far 1
n
l
a
e
b
o
l
k
o
freq[26]
1
a
1
b
0
c
0
d
1
e
0
f
0
g
0
h
0
i
0
j
1
k
2
l
0
m
1
n
2
o
0
p
0
q
0
r
0
s
0
t
0
u
0
v
0
w
0
x
0
y
0
z
b:
1
1
a:
1
1
l:
2
÷ 2
1
o:
2
÷ 2
1
n:
1
1
answer =
1
algo
master
.
io
Step:
How many times can you spell "balloon"? The scarcest letter caps it
0 / 16
Input
One balloon
Two balloons
'o' bottleneck
None
Custom
text
=
nlaebolko
0 / 16
algo
master
.
io
Step:
How many times can you spell "balloon"? The scarcest letter caps it
