📘

Longest Palindromic Substring

Given a string s, return the longest palindromic substring in s.

Input:

babad

Output:

bab

Reasoning:

The input string s is babad, and we need to find the longest palindromic substring in it.
We check for palindromes centered at each character in the string, considering both odd-length and even-length palindromes.
The longest palindromic substrings found are bab and aba, both with a length of $3$ .
Since both bab and aba are the longest palindromic substrings, the function can return either one, and in this case, it returns bab.

Editor

Python 3.13.1

0/0

Run code to see test results.

📘

Given a string s, return the longest palindromic substring in s.

Input:

babad

Output:

bab

Reasoning:

The input string s is babad, and we need to find the longest palindromic substring in it.
We check for palindromes centered at each character in the string, considering both odd-length and even-length palindromes.
The longest palindromic substrings found are bab and aba, both with a length of $3$ .
Since both bab and aba are the longest palindromic substrings, the function can return either one, and in this case, it returns bab.

Editor

Python 3.13.1

0/0

Run code to see test results.