git-osp-for-beginners
git-osp-for-beginners copied to clipboard
Palindrome Number [C++-Solution required]
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](
Can you please assign it to me?
Hi @Akanksha810 ! Love to see such enthusiasm for open-source world. I have assigned this issue to you as well. ❤ Have fun hacking !
Thank you!
Hey, I would like to contribute. Kindly assign me if available.
Hello, can I also do this problem .
Hi @Meghwantsingh @Abhishek07-0302 ! Happy to receive contribution such early. I have assigned this issue to you guys. 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 !
Thanks . OK sure
Reopening this issue for other contributors.
@aditya109 I want to work on this issue can you please assign me
Hi @MashTerro ! Sure thing. 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 !
Sure, Thanks!