input: Write a function to find the longest palindrome in a list of strings.
  assert find_longest_palidrome(["racecar", "car", "radar"]) == "racecar"
  assert find_longest_palidrome(["level", "world", "refer"]) == "refer"
  assert find_longest_palidrome(["apple", "banana", "civic", "deified"]) == "deified"
output: def find_longest_palindrome(words):
      def is_palindrome(word):
          return word == word[::-1]
  
      longest_palindrome = ""
      for word in words:
          if is_palindrome(word) and len(word) > len(longest_palindrome):
              longest_palindrome = word
      return longest_palindrome