Next Greater Element II Problem

Next Greater Element II Problem — ExecCode Easy DSA Practice

Solve the Next Greater Element II problem on ExecCode. Free online easy DSA practice in Stack. Write and run code in Java, C++, Python — no signup required to run.

Problem description

Description You are 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. Your task is to 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.

Examples

Input {"nums": [1]}; Output -1. Input {"nums": [1, 2]}; Output 2 -1. Input {"nums": [1, 2, 1]}; Output 2 -1 2

Constraints

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

Practice Next Greater Element II free on ExecCode. Browse DSA problems, topic map, and placement guides.