Open saptarshisarkar20 opened 1 year ago
Don't wait to assign this issue just start to work on it
Hey, I can work on this issue.
Sir I added this question .
Hey, I can work on this issue.
Don't wait for assignment, solve it and make a pull request
Can you please assign this issue?
i am new to open source and so interesed to work on it , ca u please assign to me.
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