input: Write a python function to find the largest palindrome number from a list of integers.
  assert largest_palindrome([4, 12, 25, 98, 9989])==9989
  assert largest_palindrome([121, 131, 99, 101, 202])==202
  assert largest_palindrome([10, 20, 30, 40, 50])==0
output: def largest_palindrome(lst):
      def is_palindrome(n):
          return str(n) == str(n)[::-1]
      
      palindromes = [n for n in lst if is_palindrome(n)]
      return max(palindromes, default=0)