Write a function in any programming language to solve the below problem Palindrome Number #1
Labels
good first issue
Good for newcomers
hacktober
hacktober-accepted
hacktoberfest
hacktoberfest2022
help wanted
Extra attention is needed
question
Further information is requested
What to Do?
Star 🌟 the repo
Fork the repo
Location
Go to folder
Solve Here/LeetCode/PalindromeNumber
File name
Take your GitHub username id like "hrithik339", "hacker-boy", etc or anything which you have.
Then add a programming language extension after this (link for C++ add .cpp and for python add.py)
Only files with the correct file name will be accepted
Problem Statement
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 a palindrome while 123 is not.
Example 1:
Explanation: 121 reads as 121 from left to right and from right to left.
Example 2:
Explanation: From left to right, it reads -121. From right to left, it becomes 121-. Therefore it is not a palindrome.
Example 3:
Explanation: Reads 01 from right to left. Therefore it is not a palindrome.
Constraints:
-231 <= x <= 231 - 1
Follow up: Could you solve it without converting the integer to a string?
Function
The text was updated successfully, but these errors were encountered: