Closed Saloni6111 closed 4 hours ago
Problem Title: Palindrome Number Link to Problem: url
Description:
Given an integer x, return true if x is a palindrome, and false otherwise.
Example 1:
Input: x = 121 Output: true Explanation: 121 reads as 121 from left to right and from right to left.
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.
Constraints:
Follow up: Could you solve it without converting the integer to a string?
Thank you for your contribution! We appreciate your help in improving the project.
Hii @Saloni6111 I'd love the opportunity to tackle this issue, Could you assign to me?
merged!
Problem Of The Day (POTD)
Problem Title: Palindrome Number Link to Problem: url
Description:
Given an integer x, return true if x is a palindrome, and false otherwise.
Example 1:
Example 2:
Example 3:
Constraints:
Follow up: Could you solve it without converting the integer to a string?
Thank you for your contribution! We appreciate your help in improving the project.