# Reverse Integer

## [Reverse Integer](https://leetcode.com/problems/reverse-integer)

Given a 32-bit signed integer, reverse digits of an integer.

**Note:**\
 Assume we are dealing with an environment that could only store integers within the 32-bit signed integer range: \[−231,  231 − 1]. For the purpose of this problem, assume that your function returns 0 when the reversed integer overflows.

**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`

## Solutions

### 🧠 Cpp

```cpp
class Solution {
public:
    int reverse(int x)
    {
        bool is_neg = x < 0;
        std::string num = std::to_string(x);
        std::reverse(num.begin()+is_neg, num.end());

        long res = std::atol(num.c_str());
        return res > numeric_limits<int>::max() || res < numeric_limits<int>::min() ? 
               0  : res;
    }
};
```


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://anton-veselskyi.gitbook.io/codding-problems-solutions/leetcode/easy/reverse-integer.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.