palindrome-number

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

Algorithms

Given an integer <code>x</code>, return <code>true</code> if <code>x</code> is a palindrome, and <code>false</code> otherwise.

&nbsp;
Example 1:

<pre>
Input: x = 121
Output: true
Explanation: 121 reads as 121 from left to right and from right to left.
</pre>

Example 2:

<pre>
Input: x = -121
Output: false
Explanation: From left to right, it reads -121. From right to left, it becomes 121-. Therefore it is not a palindrome.
</pre>

Example 3:

<pre>
Input: x = 10
Output: false
Explanation: Reads 01 from right to left. Therefore it is not a palindrome.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>-231&nbsp;&lt;= x &lt;= 231&nbsp;- 1</code></li>
</ul>

&nbsp;
Follow up: Could you solve it without converting the integer to a string?