Next Greater Element I

3Easy

Next Greater Element I

Given two arrays nums1 and nums2 (nums1 is a subset of nums2), find the next greater element for each in nums1. Return -1 if none exists.

Example 1:

Input: nums1 = [4,1,2], nums2 = [1,3,4,2] Output: [-1,3,-1]

Example 2:

Input: nums1 = [2,4], nums2 = [1,2,3,4] Output: [3,-1]

Jnaneshwara Reddy Satti

Builder · ClearCode

Hi — I'm a 21yo CS grad from India. I built ClearCode while recovering from a surgery, because I genuinely believe DSA should be visual, free, and accessible to everyone. No VC funding. No team. Just me, my laptop, and a lot of chai. ☕

If ClearCode helped you understand even one concept — consider supporting it. Every rupee keeps the servers running and new videos coming.

Support via Razorpay

Found this helpful? Support ClearCode ☕ — keeps it free forever

Algorithm Visualizer

O(N + M)

Initializing...

TEST CASE: []O(N)

clearcode.in

Execution Trace

1def nextGreaterElement(nums1, nums2):

2 stack = []

3 dict = {}

4 for num in nums2:

5 while stack and stack[-1] < num:

6 dict[stack.pop()] = num

7 stack.append(num)

8 result = []

9 for num in nums1:

10 if num in dict:

11 result.append(dict[num])

12 else:

13 result.append(-1)

14 return result

0:00 / 0:10

Next Greater Element I — Easy Stack Algorithm | ClearCode