Longest Palindromic Substring

MediumPremium

Given a string s, determine the longest palindromic substring in s. A substring is considered a palindrome if it reads the same forward and backward.

A substring is a contiguous sequence of characters within a string. The longest palindromic substring is the substring with the maximum length...

Join now to continue learning

As an Exponent member, you’ll get access to the rest of this course, and so much more.

Entire course library

Get full access to our course library, with hours of lessons and example answers.

Mock interview videos

Watch experts answer real interview questions in hundreds of videos.

Private Slack access

Join our daily discussions with 10,000 other Exponent members on Slack.

Live daily practice

With our new peer practice tool, you can practice with other members every day.
Not sure yet? Try the next free lesson