Each character (and each pair of adjacent characters) is treated as a potential center of a palindrome. Expand outwards while the characters match. Keep track of the longest palindrome found.

Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists one unique longest palindromic substring. Example Given the string ...