Tap here to switch tabs
Problem
Submissions

Problem: Next Greater Element III

Next Greater Element III asks you to rearrange an integer’s digits into the smallest larger number using the same digits. Return negative one if impossible or the result exceeds the 32-bit limit.

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:

  • 1≤1 \leq n ≤231−1\leq 2^{31} - 1

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Next Greater Element III

Next Greater Element III asks you to rearrange an integer’s digits into the smallest larger number using the same digits. Return negative one if impossible or the result exceeds the 32-bit limit.

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:

  • 1≤1 \leq n ≤231−1\leq 2^{31} - 1