BEUTIFUL RECURSION SOLUTION!!! (beated 100%)
IntuitionI didn't want to reverse the array, so I solved it using recursion.ApproachI generate the next n (next_n) and the remainder (rem) from n, and recursive
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->
I didn't want to reverse the array, so I solved it using recursion.

# Approach
<!-- Describe your approach to solving the problem. -->
I generate the next n (`next_n`) and the remainder (`rem`) from n, and recursively concatenate `str(rem)` at the end.
Isn't this code super beautiful??

# Complexity
- Time complexity:$$O(logN)$$
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:$$O(logN)$$
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```python3 []
class Solution:
    def baseNeg2(self, n: int) -> str:
        return "0" if n == 0 else self.solve(n)

    def solve(self, n):
        if n == 0:
            return ""
        next_n, rem = divmod(n, -2)
        if rem < 0:
            next_n += 1
            rem += 2
        return self.solve(next_n) + str(rem)

```
['Python3']