You've successfully subscribed to The Poor Coder | Hackerrank Solutions
Great! Next, complete checkout for full access to The Poor Coder | Hackerrank Solutions
Welcome back! You've successfully signed in.
Success! Your account is fully activated, you now have access to all content.

Leetcode - Reverse Integer Solution

Beeze Aal
Beeze Aal

Given a signed 32-bit integer x, return x with its digits reversed. If reversing x causes the value to go outside the signed 32-bit integer range [-231, 231 - 1], then return 0.

Assume the environment does not allow you to store 64-bit integers (signed or unsigned).

Example 1:

Input: x = 123
Output: 321

Example 2:

Input: x = -123
Output: -321

Example 3:

Input: x = 120
Output: 21

Example 4:

Input: x = 0
Output: 0

Constraints:

  • -231 <= x <= 231 - 1

Solution in Python

class Solution:
    def reverse(self, x: int) -> int:
        if x<0:
            x = int(str(x*-1)[::-1])*-1
        else:
            x = int(str(x)[::-1])
        if x >= -2**31 and x <= 2**31-1:
            return x
        else:
            return 0