Given an integer x, return true if x is a palindrome, and false otherwise.
An integer is a palindrome when it reads the same forward and backward.
Examples
Example 1
Input: x = 121
Output: true
121 reads as 121 from left to right and from right to left.
Example 2
Input: x = -121
Output: false
From left to right, it reads -121. From right to left, it reads 121-. Therefore it is not a palindrome.
Example 3
Input: x = 10
Output: false
Reads 01 from right to left. Therefore it is not a palindrome.
Constraints
-2³¹ <= x <= 2³¹ - 1
Follow up: Could you solve it without converting the integer to a string?