# Palindrome Number - Leetcode #9 Short & Simple Solution

Updated: Jun 20, 2022

## Problem Statement

In our previous article we solved the string to integer problem. This is another article in the series leetcode problem solutions and this article is a solution to leetcode 9 problem.

Given an integer x, return true if x is a palindrome integer. An integer is a **palindrome** when it reads the same backward as forward. Example, 121 is a palindrome while 123 is not.

**Constraints:**

-2^31 <= x <= 2^31 - 1

## Example

### Example 1

**Input****:** x = 121
**Output****:** true

### Example 2

**Input****:** x = -121
**Output****:** false

### Example 3

**Input****:** x = 10
**Output****:** false

## Solution

This is one of the easier problems on leetcode and also an important one because the solution involves ingredients necessary to solve similar problems around number manipulation.

Lets understand the problem statement first. In this problem we are given an integer value as input, our task is to write an algorithm that tells us whether the given number is a palindrome or not. So, what are palindromic numbers? A number is a palindrome if it remains same when its digits are reversed. In other words a number is a palindrome if we get the same sequence of digits whether we read the number from left to right or right to left. For example 121, 99, 2332 etc. are palindromic numbers.

### Solution 1

The first solution that might come to your min