Solution: Next Greater Element III
Explore how to apply the two-pointer technique to find the smallest integer larger than a given number by rearranging its digits. Learn to identify pivot points, perform swaps, and reverse suffixes to produce valid permutations within 32-bit integer constraints.
We'll cover the following...
We'll cover the following...
Statement
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:
...