DIY: Longest Palindromic Substring

Solve the interview question "Longest Palindromic Substring" yourself in this lesson.

Problem statement

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

Input

The input will contain a string s. The following is an example input:

"bccd"

Output

The output will be a string representing the longest palindrome. The following is an example output:

"cc"

Level up your interview prep. Join Educative to access 70+ hands-on prep courses.