Reverse Integer Problem Statement

Given a 32-bit signed integer N, your task is to return the reversed integer. If reversing the integer causes overflow, return -1.

Input:

The first line contains an integer 'T', the number of test cases. Each test case consists of a single line containing a 32-bit signed integer 'N'.

Output:

For each test case, return the reversed integer of 'N'. Output each result on a new line.

Example:

Input:

3
123
-123
120

Output:

321
-321
21

Constraints:

1

Question

Reverse Integer Problem Statement

Given a 32-bit signed integer N, your task is to return the reversed integer. If reversing the integer causes overflow, return -1.

Input:

The first line contains an integer 'T', the number of test cases.
Each test case consists of a single line containing a 32-bit signed integer 'N'.

Output:

For each test case, return the reversed integer of 'N'.
Output each result on a new line.

Example:

Input:

Output:

321
-321
21

Constraints:

1 <= T <= 5
-2³¹ <= N <= 2³¹ - 1
Time limit: 1 sec

Note:

Do not use data types with more than 32-bit capacity. Assume the environment does not allow storing 64-bit integers. You do not need to print anything; implementation of the function is required.

Accepted Answer

The task is to reverse a 32-bit signed integer and handle overflow cases.

Create a function that takes a 32-bit signed integer as input
Reverse the integer while handling overflow cases
Return the reversed integer or -1 if overflow occurs

Accepted Answer

Implementation The idea is to use the fact that the input ‘N’ is a 32 bit signed integer. So, as mentioned, -2147483648 <= ‘N’ <= 2147483647. In this range, for ‘N’ = 10 * x + y, the ‘N’ can never at...read more