Reverse Integer

Problem Statement

Reverse digits of an integer.

Example1: x = 123, return 321
Example2: x = -123, return -321

 

Have you thought about this? Here are some good questions to ask before coding. Bonus points for you if you have already thought through this!
If the integer's last digit is 0, what should the output be? ie, cases such as 10, 100.
Did you notice that the reversed integer might overflow? Assume the input is a 32-bit integer, then the reverse of 1000000003 overflows. How should you handle such cases?
For the purpose of this problem, assume that your function returns 0 when the reversed integer overflows.

Source: https://leetcode.com/problems/reverse-integer/
Programming Language: C#

Solution
 

public int Reverse(int x)
{
    bool isNeg = false;
    long result = 0;
    
    // Check if the number is negative   
    if (x < 0)
    {
        isNeg = true;
        x *= -1;
    }
    
    // While number is processed
    while (x > 0)
    {   
        // Grab the last digit from mod operation and add to result
        result = result * 10 + (x % 10);
        
        // If there is int overflow return 0   
        if (result >= Int32.MaxValue)
            return 0;

        x = x / 10;
    }
    
    // if number is negative update the sign
    if (isNeg)
        result *= -1;
    

    // cast it to int and return
    return (int)result;
}