211. Palindrome Number
You are given an integer n. You need to check whether the number is a palindrome number or not. Return true if it's a palindrome number, otherwise return false.
A palindrome number is a number which reads the same both left to right and right to left.
Example 1:
Input: n = 121
Output: true
Explanation: When read from left to right : 121.
When read from right to left : 121.
Example 2:
Input: n = 123
Output: false
Explanation: When read from left to right : 123.
When read from right to left : 321.
Now Your Turn!
Pick the correct output for the given inputInput: 101
Still unsure what the problem is asking ?
Let’s go through a few more examples, step by step, to make it clearer.
Constraints:
- 0 <= n <= 5000
- n will contain no leading zeroes except when it is 0 itself.