Palindrome Number [Python-Solution required]

[aditya109]

Given an integer x, return true if x is palindrome integer.

An integer is a palindrome when it reads the same backward as forward. For example, 121 is palindrome while 123 is not.

Example 1:

Input: x = 121
Output: true

Example 2:

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.

Example 3:

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

Example 4:

Input: x = -101
Output: false

Constraints:

• -231 <= x <= 231 - 1

Reference Link: [(1) Palindrome Number - LeetCode](

[NidhiMalpani]

Hello. I would like to work on this issue. Could you please assign it to me?

[aditya109]

Hi @NidhiMalpani ! I have assigned this issue to you. Before raising a PR, please take a look at CONTRIBUTING.md and follow the guidelines. Also, if it is not too much to ask, please consider starring ⭐ the repository. It helps boost the repo popularity and guide more people towards active contribution. That is all. Happy hacking !

[aditya109]

Hi @NidhiMalpani ! Assigning this issue to you. As a PR for this is already merged, please create a separate file in the same folder. Refer to this PR https://github.com/aditya109/git-osp-for-beginners/pull/475 while raising your PR. Create a separate file in the same location.