63. Longest Palindromic Substring

Given a string s, return the longest palindromic substring in s.

A palindrome is a string that reads the same backward as forward.

Examples

longestPalindrome("babad"); // "bab" or "aba"
longestPalindrome("cbbd");  // "bb"
longestPalindrome("a");     // "a"