Learn
Practice
Interview
Resources
Newsletter
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Longest Palindromic Substring
Bookmark
Brute Force
Expand Center
DP
Input
Input 1
Input 2
Input 3
Custom
s
=
babad
0
1
2
3
4
b
a
b
a
d
best =
""
0
1
2
3
4
b
a
b
a
d
best =
""
0
1
2
3
4
b
a
b
a
d
L
R
length =
1
best =
"b"
result = "b"
every single character is a palindrome
0
1
2
3
4
b
a
b
a
d
L
R
length =
3
best =
"bab"
"bab"
is a palindrome and longer → result =
"bab"
0
1
2
3
4
b
a
b
a
d
L
R
length =
4
best =
"bab"
"baba"
→ 'b'
!=
'a'
not a palindrome
0
1
2
3
4
b
a
b
a
d
L
R
length =
5
best =
"bab"
"babad"
→ 'b'
!=
'd'
not a palindrome
0
1
2
3
4
b
a
b
a
d
L
R
length =
3
best =
"bab"
"aba"
length 3 <= best 3
→ skip, cannot win
0
1
2
3
4
b
a
b
a
d
L
R
length =
4
best =
"bab"
"abad"
→ 'a'
!=
'd'
not a palindrome
0
1
2
3
4
b
a
b
a
d
L
R
length =
2
best =
"bab"
"ba"
length 2 <= best 3
→ skip, cannot win
0
1
2
3
4
b
a
b
a
d
L
R
length =
2
best =
"bab"
"ad"
length 2 <= best 3
→ skip, cannot win
0
1
2
3
4
b
a
b
a
d
L
R
best =
"bab"
return "bab"
length 3
algo
master
.
io
Step:
Find the longest palindromic substring of "babad"
0 / 12
Input
Input 1
Input 2
Input 3
Custom
s
=
babad
0 / 12
algo
master
.
io
Step:
Find the longest palindromic substring of "babad"
