Skip to content

Practice Next Greater Element II

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Medium#503
LeetCode Problem

Next Greater Element II

Problem Statement

Given a circular integer array nums (i.e., the next element of nums[nums.length - 1] is nums[0]), return the next greater number for every element in nums. The next greater number of a number x is the first greater number to its traversing-order next in the array, which means you could search circularly to find its next greater number. If it doesn't exist, return -1 for this number.

Source: Next Greater Element II on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
nums = [1,2,1]
Output
[2,-1,2]

# Example 2

Input
nums = [1,2,3,4,3]
Output
[2,3,4,-1,4]

Constraints

1 <= nums.length <= 10^4
-10^9 <= nums[i] <= 10^9

Related LeetCode Problems

Practice more problems similar to Next Greater Element II.

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.