A Number After a Double Reversal — LeetCode 2119 Python Solution
EasyMath
- Problem
- #2119
- Pattern
- Math and Number Theory
- Reading time
- 2 min
- Source
- leetcode.com
The problem
Reversing an integer means to reverse all its digits. For example, reversing 2021 gives 1202.
Example
- Input
- num = 526
- Output
- true
- Explanation
- Reverse num to get 625, then reverse 625 to get 526, which equals num.
Python solution
Python
class Solution:
def isSameAfterReversals(self, num: int) -> bool:
return num == 0 or num % 10 != 0Complexity
| Measure | Complexity |
|---|---|
| Time | O(1) |
| Space | O(1) auxiliary |
Pattern: Math and Number Theory
Find the closed form, the invariant, or the modular identity — and skip the loop entirely. LeetCode 2119. A Number After a Double Reversal is filed here on both counts: the reference solution below belongs to the algorithm family this hub collects, and LeetCode tags it Math.
The math and number theory guide has the Python template for the pattern and the 485 LeetCode problems that use it.
Related problems
Frequently asked questions
- How hard is LeetCode 2119. A Number After a Double Reversal?
- LeetCode 2119. A Number After a Double Reversal is rated Easy on LeetCode.
- What is the time complexity of LeetCode 2119. A Number After a Double Reversal?
- The Python solution on this page runs in O(1).
- What is the space complexity of LeetCode 2119. A Number After a Double Reversal?
- The Python solution on this page uses O(1) auxiliary space.
- What topics does LeetCode 2119. A Number After a Double Reversal cover?
- LeetCode 2119. A Number After a Double Reversal is tagged Math on LeetCode.