7. Reverse Integer - Explanation

Description

You are given a signed 32-bit integer x.

Return x after reversing each of its digits. After reversing, if x goes outside the signed 32-bit integer range [-2^31, 2^31 - 1], then return 0 instead.

Solve the problem without using integers that are outside the signed 32-bit integer range.

Example 1:

Input: x = 1234

Output: 4321

Example 2:

Input: x = -1234

Output: -4321

Example 3:

Input: x = 1234236467

Output: 0

Constraints:

-2^31 <= x <= 2^31 - 1

Topics

Math

Recommended Time & Space Complexity

You should aim for a solution with O(1) time and O(1) space.

Hint 1

A straightforward approach would be to convert the given integer to a string, reverse it, convert it back to an integer using a long type, and return 0 if the result exceeds the integer range. Can you think of a better way?

Hint 2

We initially declare the result res as an int with a value of 0. We iterate through the given integer, extracting digits one by one. Before appending a digit to res, we consider multiple cases. Can you determine them? Maybe you should think about overflow.

Hint 3

Let MAX be the maximum positive integer and MIN be the minimum negative integer. We iterate through each digit and check for overflow before updating res. If res > MAX / 10 or res < MIN / 10, return 0. If res == MAX / 10 and the current digit is greater than MAX % 10, return 0. If res == MIN / 10 and the current digit is less than MIN % 10, return 0. Otherwise, append the digit to res and continue.

Company Tags

Please upgrade to NeetCode Pro to view company tags.

Prerequisites

Before attempting this problem, you should be comfortable with:

Integer Arithmetic - Using modulo (%) to extract digits and integer division (/) to remove digits
Overflow Detection - Understanding 32-bit signed integer bounds and checking for overflow before it occurs
Handling Negative Numbers - Knowing how modulo and division behave differently for negative values across languages

1. Brute Force

Intuition

We want to reverse the digits of an integer x (for example, 123 -> 321, -120 -> -21).

A very simple way to do this is:

ignore the sign for a moment and work with the absolute value
convert the number to a string so digits become easy to manipulate
reverse the string and convert it back to an integer
restore the original sign if x was negative

Finally, the problem usually requires that the answer must fit in a 32-bit signed integer range:

from -2^31 to 2^31 - 1
If the reversed number goes outside this range, we return 0.

This approach is beginner-friendly because it uses direct operations on strings instead of manual digit math.

Algorithm

Save the original value of x in org so we remember its sign.
Convert x to its absolute value.
Convert the number to a string.
Reverse the string.
Convert the reversed string back to an integer res (this automatically removes leading zeros).
If the original number was negative, make res negative.
Check if res fits in the 32-bit signed integer range:
- If it does not, return 0.
Otherwise, return the reversed number.

class Solution:
    def reverse(self, x: int) -> int:
        org = x
        x = abs(x)
        res = int(str(x)[::-1])
        if org < 0:
            res *= -1
        if res < -(1 << 31) or res > (1 << 31) - 1:
            return 0
        return res

public class Solution {
    public int reverse(int x) {
        int org = x;
        x = Math.abs(x);
        long res = Long.parseLong(new StringBuilder(
                   String.valueOf(x)).reverse().toString()
                );
        if (org < 0) {
            res *= -1;
        }
        if (res < -(1 << 31) || res > (1 << 31) - 1) {
            return 0;
        }
        return (int)res;
    }
}

class Solution {
public:
    int reverse(int x) {
        int org = x;
        x = abs(x);
        string strX = to_string(x);
        std::reverse(strX.begin(), strX.end());
        long long res = stoll(strX);
        if (org < 0) {
            res *= -1;
        }
        if (res < -(1LL << 31) || res > (1LL << 31) - 1) {
            return 0;
        }
        return static_cast<int>(res);
    }
};

class Solution {
    /**
     * @param {number} x
     * @return {number}
     */
    reverse(x) {
        const org = x;
        x = Math.abs(x);
        let res = parseInt(x.toString().split('').reverse().join(''));
        if (org < 0) {
            res *= -1;
        }
        if (res < -(2 ** 31) || res > 2 ** 31 - 1) {
            return 0;
        }
        return res;
    }
}

public class Solution {
    public int Reverse(int x) {
        int org = x;
        x = Math.Abs(x);
        char[] arr = x.ToString().ToCharArray();
        Array.Reverse(arr);

        long res = long.Parse(new string(arr));
        if (org < 0) {
            res *= -1;
        }

        if (res < int.MinValue || res > int.MaxValue) {
            return 0;
        }
        return (int)res;
    }
}

func reverse(x int) int {
    org := x
    x = abs(x)
    res := 0

    for x > 0 {
        res = res*10 + x%10
        x /= 10
    }

    if org < 0 {
        res = -res
    }
    if res < -(1 << 31) || res > (1<<31)-1 {
        return 0
    }
    return res
}

func abs(x int) int {
    if x < 0 {
        return -x
    }
    return x
}

class Solution {
    fun reverse(x: Int): Int {
        val org = x
        var num = Math.abs(x)
        var res = 0

        while (num > 0) {
            if (res > (Int.MAX_VALUE - num % 10) / 10) {
                return 0
            }
            res = res * 10 + num % 10
            num /= 10
        }

        if (org < 0) {
            res = -res
        }
        return if (res < Int.MIN_VALUE || res > Int.MAX_VALUE) 0 else res
    }
}

class Solution {
    func reverse(_ x: Int) -> Int {
        let org = x
        var x = abs(x)
        var res = Int(String(String(x).reversed()))!

        if org < 0 {
            res *= -1
        }
        if res < Int32.min || res > Int32.max {
            return 0
        }

        return res
    }
}

impl Solution {
    pub fn reverse(x: i32) -> i32 {
        let org = x;
        let x = (x as i64).abs();
        let reversed: String = x.to_string().chars().rev().collect();
        let mut res: i64 = reversed.parse().unwrap();
        if org < 0 {
            res *= -1;
        }
        if res < i32::MIN as i64 || res > i32::MAX as i64 {
            return 0;
        }
        res as i32
    }
}

Time & Space Complexity

Time complexity: $O(1)$
Space complexity: $O(1)$

2. Recursion

Intuition

We want to reverse the digits of an integer while preserving its sign and ensuring the result fits within the 32-bit signed integer range.

Instead of reversing digits using strings, this approach uses pure arithmetic and recursion.
The idea is simple:

Take the last digit of the number
Append it to a running reversed value
Remove the last digit from the number
Repeat until the number becomes 0

Recursion naturally fits this process because each step reduces the problem size by one digit.

Algorithm

Determine the sign of the number (+ or -) and work with its absolute value.
Define a recursive function rec that takes:
- the remaining number n
- the reversed number built so far rev
Base case:
- If n is 0, return rev.
Recursive step:
- Extract the last digit using modulo (n % 10)
- Append it to rev (rev * 10 + digit)
- Recurse on the remaining number (n // 10)
After recursion finishes:
- Restore the original sign.
Check for 32-bit signed integer overflow:
- If overflow occurs, return 0.
Otherwise, return the reversed number.

class Solution:
    def reverse(self, x: int) -> int:
        def rec(n: int, rev: int) -> int:
            if n == 0:
                return rev

            rev = rev * 10 + n % 10
            return rec(n // 10, rev)

        sign = -1 if x < 0 else 1
        x = abs(x)
        reversed_num = rec(x, 0)
        reversed_num *= sign
        if reversed_num < -(1 << 31) or reversed_num > (1 << 31) - 1:
            return 0

        return reversed_num

public class Solution {
    public int reverse(int x) {
        long res = rec(Math.abs(x), 0) * (x < 0 ? -1 : 1);
        if (res < Integer.MIN_VALUE || res > Integer.MAX_VALUE) {
            return 0;
        }
        return (int) res;
    }

    private long rec(int n, long rev) {
        if (n == 0) {
            return rev;
        }
        rev = rev * 10 + n % 10;
        return rec(n / 10, rev);
    }
}

class Solution {
public:
    int reverse(int x) {
        long res = rec(abs(x), 0) * (x < 0 ? -1 : 1);
        if (res < INT_MIN || res > INT_MAX) {
            return 0;
        }
        return (int)res;
    }

private:
    long rec(int n, long rev) {
        if (n == 0) {
            return rev;
        }
        rev = rev * 10 + n % 10;
        return rec(n / 10, rev);
    }
};

class Solution {
    /**
     * @param {number} x
     * @return {number}
     */
    reverse(x) {
        let res = this.rec(Math.abs(x), 0) * (x < 0 ? -1 : 1);
        if (res < -(2 ** 31) || res > 2 ** 31 - 1) {
            return 0;
        }
        return res;
    }

    /**
     * @param {number} n
     * @param {number} rev
     * @return {number}
     */
    rec(n, rev) {
        if (n === 0) {
            return rev;
        }
        rev = rev * 10 + (n % 10);
        return this.rec(Math.floor(n / 10), rev);
    }
}

func reverse(x int) int {
    var rec func(int, int) int
    rec = func(n, rev int) int {
        if n == 0 {
            return rev
        }
        rev = rev*10 + n%10
        return rec(n/10, rev)
    }

    sign := 1
    if x < 0 {
        sign = -1
        x = -x
    }

    reversedNum := rec(x, 0) * sign
    if reversedNum < -(1<<31) || reversedNum > (1<<31)-1 {
        return 0
    }
    return reversedNum
}

class Solution {
    fun reverse(x: Int): Int {
        val res = rec(Math.abs(x), 0L) * if (x < 0) -1 else 1
        return if (res < Int.MIN_VALUE || res > Int.MAX_VALUE) 0 else res.toInt()
    }

    private fun rec(n: Int, rev: Long): Long {
        if (n == 0) return rev
        return rec(n / 10, rev * 10 + n % 10)
    }
}

class Solution {
    func reverse(_ x: Int) -> Int {
        func rec(_ n: Int, _ rev: Int) -> Int {
            if n == 0 {
                return rev
            }
            return rec(n / 10, rev * 10 + n % 10)
        }

        let sign = x < 0 ? -1 : 1
        let reversedNum = rec(abs(x), 0) * sign

        if reversedNum < Int32.min || reversedNum > Int32.max {
            return 0
        }

        return reversedNum
    }
}

impl Solution {
    pub fn reverse(x: i32) -> i32 {
        fn rec(n: i64, rev: i64) -> i64 {
            if n == 0 {
                return rev;
            }
            rec(n / 10, rev * 10 + n % 10)
        }

        let sign: i64 = if x < 0 { -1 } else { 1 };
        let reversed_num = rec((x as i64).abs(), 0) * sign;
        if reversed_num < i32::MIN as i64 || reversed_num > i32::MAX as i64 {
            return 0;
        }
        reversed_num as i32
    }
}

Time & Space Complexity

Time complexity: $O(1)$
Space complexity: $O(1)$

3. Iteration

Intuition

We want to reverse the digits of an integer without using strings, while also ensuring the result fits within the 32-bit signed integer range.

The key idea is to build the reversed number digit by digit:

Repeatedly take the last digit of the number
Append it to the end of a running res
Remove the last digit from the original number

However, before appending a new digit, we must check for overflow.
If multiplying res by 10 (and adding the new digit) would exceed the 32-bit signed integer limits, we immediately return 0.

This approach closely matches how integer reversal works at a low level and is both efficient and safe.

Algorithm

Define constants:
- MIN = -2^31
- MAX = 2^31 - 1
Initialize res = 0 to store the reversed number.
While x is not 0:
- Extract the last digit digit of x.
- Remove the last digit from x.
- Before updating res, check:
  - If res * 10 + digit would overflow the 32-bit signed integer range:
    - Return 0.
- Update res = res * 10 + digit.
After the loop finishes, return res.

class Solution:
    def reverse(self, x: int) -> int:
        MIN = -2147483648  # -2^31,
        MAX = 2147483647  #  2^31 - 1

        res = 0
        while x:
            digit = int(math.fmod(x, 10))
            x = int(x / 10)

            if res > MAX // 10 or (res == MAX // 10 and digit > MAX % 10):
                return 0
            if res < MIN // 10 or (res == MIN // 10 and digit < MIN % 10):
                return 0
            res = (res * 10) + digit

        return res

public class Solution {
    public int reverse(int x) {
        final int MIN = -2147483648; // -2^31
        final int MAX = 2147483647;  // 2^31 - 1

        int res = 0;
        while (x != 0) {
            int digit = x % 10;
            x /= 10;

            if (res > MAX / 10 || (res == MAX / 10 && digit > MAX % 10))
                return 0;
            if (res < MIN / 10 || (res == MIN / 10 && digit < MIN % 10))
                return 0;
            res = (res * 10) + digit;
        }

        return res;
    }
}

class Solution {
public:
    int reverse(int x) {
        const int MIN = -2147483648; // -2^31
        const int MAX = 2147483647;  // 2^31 - 1

        int res = 0;
        while (x != 0) {
            int digit = x % 10;
            x /= 10;

            if (res > MAX / 10 || (res == MAX / 10 && digit > MAX % 10))
                return 0;
            if (res < MIN / 10 || (res == MIN / 10 && digit < MIN % 10))
                return 0;
            res = (res * 10) + digit;
        }

        return res;
    }
};

class Solution {
    /**
     * @param {number} x
     * @return {number}
     */
    reverse(x) {
        const MIN = -2147483648; // -2^31
        const MAX = 2147483647; // 2^31 - 1

        let res = 0;
        while (x !== 0) {
            const digit = x % 10;
            x = Math.trunc(x / 10);

            if (res > MAX / 10 || (res === MAX / 10 && digit > MAX % 10))
                return 0;
            if (res < MIN / 10 || (res === MIN / 10 && digit < MIN % 10))
                return 0;
            res = res * 10 + digit;
        }

        return res;
    }
}

public class Solution {
    public int Reverse(int x) {
        const int MIN = -2147483648; // -2^31
        const int MAX = 2147483647;  // 2^31 - 1

        int res = 0;
        while (x != 0) {
            int digit = x % 10;
            x /= 10;

            if (res > MAX / 10 || (res == MAX / 10 && digit > MAX % 10))
                return 0;
            if (res < MIN / 10 || (res == MIN / 10 && digit < MIN % 10))
                return 0;
            res = (res * 10) + digit;
        }

        return res;
    }
}

func reverse(x int) int {
    MIN := -2147483648 // -2^31
    MAX := 2147483647  // 2^31 - 1

    res := 0
    for x != 0 {
        digit := int(math.Mod(float64(x), 10))
        x = int(float64(x) / 10)

        if res > MAX/10 || (res == MAX/10 && digit > MAX%10) {
            return 0
        }
        if res < MIN/10 || (res == MIN/10 && digit < MIN%10) {
            return 0
        }
        res = (res * 10) + digit
    }

    return res
}

class Solution {
    fun reverse(x: Int): Int {
        val MIN = -2147483648 // -2^31
        val MAX = 2147483647  // 2^31 - 1

        var res = 0
        var num = x
        while (num != 0) {
            val digit = (num % 10).toInt()
            num /= 10

            if (res > MAX / 10 || (res == MAX / 10 && digit > MAX % 10)) {
                return 0
            }
            if (res < MIN / 10 || (res == MIN / 10 && digit < MIN % 10)) {
                return 0
            }
            res = res * 10 + digit
        }

        return res
    }
}

class Solution {
    func reverse(_ x: Int) -> Int {
        let MIN = Int32.min
        let MAX = Int32.max

        var res = 0
        var num = x

        while num != 0 {
            let digit = num % 10
            num /= 10

            if res > MAX / 10 || (res == MAX / 10 && digit > MAX % 10) {
                return 0
            }
            if res < MIN / 10 || (res == MIN / 10 && digit < MIN % 10) {
                return 0
            }
            res = res * 10 + digit
        }

        return res
    }
}

impl Solution {
    pub fn reverse(x: i32) -> i32 {
        let mut res: i32 = 0;
        let mut num = x;

        while num != 0 {
            let digit = num % 10;
            num /= 10;

            if res > i32::MAX / 10 || (res == i32::MAX / 10 && digit > 7) {
                return 0;
            }
            if res < i32::MIN / 10 || (res == i32::MIN / 10 && digit < -8) {
                return 0;
            }
            res = res * 10 + digit;
        }

        res
    }
}

Time & Space Complexity

Time complexity: $O(1)$
Space complexity: $O(1)$

Common Pitfalls

Checking for Overflow After It Happens

A critical mistake is multiplying res by 10 and adding the digit before checking if the result overflows. By that point, overflow has already occurred and the value is corrupted. The overflow check must happen before the multiplication to determine if the next operation would exceed the 32-bit signed integer bounds.

Incorrect Handling of Negative Numbers with Modulo

Different programming languages handle the modulo operation differently for negative numbers. In Python, -123 % 10 returns 7, not -3. Using the wrong modulo behavior leads to incorrect digit extraction for negative inputs. Use language-specific functions like math.fmod() in Python or ensure consistent handling across languages.

Forgetting the Asymmetric Range of 32-bit Signed Integers

The 32-bit signed integer range is asymmetric: -2^31 to 2^31 - 1. This means the minimum value has a larger absolute value than the maximum. When checking for overflow, both boundaries must be validated separately. Simply checking against one limit and assuming symmetry causes edge cases like reversing 1534236469 to fail silently.