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