input: Write a python function to find the largest palindrome in a given range.
  assert get_largest_palindrome_in_range(10, 99) == 99
  assert get_largest_palindrome_in_range(100, 150) == 141
  assert get_largest_palindrome_in_range(1, 9) == 9
output: def get_largest_palindrome_in_range(start, end):
      def is_palindrome(x):
          return str(x) == str(x)[::-1]
      
      largest_palindrome = -1
      for num in range(start, end + 1):
          if is_palindrome(num) and num > largest_palindrome:
              largest_palindrome = num
      
      return largest_palindrome