Given a circular integer array nums, where the element after nums[nums.length - 1] is nums[0], return an array containing the next greater element for each element in nums.

The next greater element of nums[i] is the first element that is strictly greater than nums[i] when traversing forward from index $i + 1$, with circular wraparound allowed.

If no greater element exists for nums[i], return $-1$ for that position.

Constraints:

• $1 \leq$ nums.length $\leq 10^4$

• $-10^9 \leq$ nums[i] $\leq 10^9$

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.