Find longest palindromic substring

Q: Find longest palindromic substring

This is a Coding & Algorithms interview question from Meta for Machine Learning Engineer roles. View the full question and solution on PracHub.

Q: How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

Question

Loading...

Given a string s, return the longest contiguous substring of s that is a palindrome.

Input

A single string s .

Output

A string representing the longest palindromic substring (if multiple answers exist, return any one).

Constraints

1 <= len(s) <= 2000 (or similar typical interview constraints)
s contains ASCII letters/digits.

Examples

s = "babad" → "bab" (or "aba" )
s = "cbbd" → "bb"

Find longest palindromic substring

Input

Output

Constraints

Examples

Comments (0)