Given a string s, write pseudo-code to find the longest palindromic substring in s in linear time. Do not use Manacher's algorithm. For example if input is "aacecaaa" output is "aacecaa".