Return the longest palindromic substring of a string
A substring is mirrored (a palindrome) when it reads the same forwards and backwards, like 'level' or 'noon'. Implement longestPalindrome(text), which returns the longest mirrored substring of text.
longestPalindrome(text) // => a substring of text
'A' and 'a' are different, and spaces and punctuation are ordinary characters.''.longestPalindrome('xracecary');
// => 'racecar'
longestPalindrome('abccbx');
// => 'bccb' (even length)
longestPalindrome('pqrstutsr');
// => 'rstutsr'
longestPalindrome('abcd');
// => 'a' (every option has length 1; 'a' starts first)
longestPalindrome('Aba');
// => 'A' (case matters, so 'Aba' is not a palindrome)
longestPalindrome('step on no pets');
// => 'step on no pets'
longestPalindrome('');
// => ''