Your task is to rearrange an array, nums, containing positive integers to form the next lexicographically greater permutationA permutation of an array of integers refers to any ordering of its elements into a sequence or linear arrangement.. This means finding the next permutation in the sequence of all possible arrangements sorted in dictionary order.

For example, given the array $[4, 5, 6]$, the next permutation is $[4, 6, 5]$. In the same way, $[5, 6, 4]$ becomes $[6, 4, 5]$.

If the array is already in its highest possible order (sorted in descending order), such as $[6, 5, 4]$, it’s not possible to find a lexicographically larger permutation. In this case, you must rearrange the array to its lowest possible order (sorted in ascending order), which would be $[4, 5, 6]$.

The entire operation must be completed in-place while using only a constant amount of extra memory.

Constraints:

• $1 \leq$ nums.length $\leq 100$

• $0 \leq$ nums[i] $\leq 100$

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.