Next Greater Element II | Dataford Interview Questions

Next Greater Element II.

Asked in the Round 1 DSA stage.

Implement a function that returns, for each element in a circular integer array, the first greater element to its right. If no greater element exists, return -1 for that position.

Function

next_greater_elements(nums)

Input

nums: a list of integers

Output

A list of integers where result[i] is the next greater element for nums[i] in circular order.

Example 1

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

Example 2

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

Constraints

1 <= len(nums) <= 10^4
-10^9 <= nums[i] <= 10^9
The array is circular

Function Signature

def next_greater_elements(nums):

Your question is Next Greater Element II. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem