ProblemsStacks & QueuesNext Greater Element I

easy

DryAlgo’s workspace is built for a larger screen — for the full experience, open this on a desktop or laptop.

Next Greater Element I

easy

You are given two arrays nums1 and nums2, where nums1 is a subset of nums2 (all values in both are distinct). For each value in nums1, find its next greater element in nums2 — the first value to its right in nums2 that's bigger. If none exists, use -1.

Example

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

Constraints

•1 ≤ nums1.length ≤ nums2.length ≤ 1000

Note

Can you resolve every value in one O(n) pass over nums2, rather than a separate scan per query?

Test cases

Hints0/4 revealed

Sandboxed · 5s cap

Run the solution to see the execution log.