input: ### Instruction:
  Write a function to determine if an input list is a valid palindrome, which means it reads the same backward as forward. The function should return True if the input list is a palindrome, and False otherwise.
  
  ### Output:
  def is_palindrome(lst):
      return lst == lst[::-1]
  
  assert is_palindrome([1, 2, 3, 2, 1]) == True
  assert is_palindrome([1, 2, 3, 4, 5]) == False
  assert is_palindrome(["a", "b", "c", "b", "a"]) == True
  assert is_palindrome(["a", "b", "c", "d", "e"]) == False
  assert is_palindrome([]) == True
output:     
      return lst == lst[::-1]
  
  assert is_palindrome([1, 2, 3, 2, 1]) == True
  assert is_palindrome([1, 2, 3, 4, 5]) == False
  assert is_palindrome(["a", "b", "c", "b", "a"]) == True
  assert is_palindrome(["a", "b", "c", "d", "e"]) == False
  assert is_palindrome([]) == True
  