Given a positive integer n, rearrange its digits to form the smallest possible integer that is greater than n.

The resulting integer must use exactly the same digits as n, with each digit used the same number of times.

If it is not possible to create a larger number using the same digits, return -1.

Note: If the resulting number does not fit within a 32-bit signed integer, return -1.

Constraints:

• $1 \leq$ n $\leq 2^{31} - 1$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.