# 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.

# Explanation: The answer is "wke", with the length of 3. # Notice that the answer must be a substring, "pwke" is a subsequence and not a substring.