input: Write a python function to find the longest palindrome in a given string.
  assert findLongestPalindrome("babad") == "bab" or findLongestPalindrome("babad") == "aba"
  assert findLongestPalindrome("cbbd") == "bb"
  assert findLongestPalindrome("a") == "a"
  assert findLongestPalindrome("ac") == "a" or findLongestPalindrome("ac") == "c"
output: def findLongestPalindrome(s: str) -> str:
      if len(s) == 0:
          return ""
      
      def expand_around_center(left: int, right: int) -> str:
          while left >= 0 and right < len(s) and s[left] == s[right]:
              left -= 1
              right += 1
          return s[left + 1:right]
      
      longest = ""
      for i in range(len(s)):
          # Odd-length palindromes
          temp = expand_around_center(i, i)
          if len(temp) > len(longest):
              longest = temp
          # Even-length palindromes
          temp = expand_around_center(i, i + 1)
          if len(temp) > len(longest):
              longest = temp
      
      return longest