LeetCode Algorithms Solved

=================

Problem Statement :

=================

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

Constraints:

• -231 <= x <= 231 - 1

======================

Solution :

======================

Yet another simple problem with couple of special conditions.

1. Negative Integers.
2. Overflowing integers.

We tackle this problem in the following manner using O(n) algorithm, where n is the number of digits in the integer.

1. We first convert the integer to String using Convert.Tostring() function.
2. We determine negative/positive clause using the string’s first index.
3. And then we reverse the string.
4. And we convert the string to long using Convert.ToInt64() function.
5. And the check for integer overflow happens here returning zero for overflow and converted integer otherwise.

Code for the same can be found @ Reverse Integer – LeetCode

– Vamshi.