Skip to content

problem6.md

Latest commit

 

History

History
13 lines (10 loc) · 678 Bytes

problem6.md

File metadata and controls

13 lines (10 loc) · 678 Bytes

Problem 6: Nearest Superior Element

Problem Statement

The next greater element of some element x in an array is the first greater element that is to the right of x in the same array. You are given two distinct 0-indexed integer arrays nums1 and nums2, where nums1 is a subset of nums2. For each 0 <= i < nums1.length, find the index j such that nums1[i] == nums2[j] and determine the next greater element of nums2[j] in nums2. If there is no next greater element, then the answer for this query is -1.

Input Format

  • Two integer arrays nums1 and nums2.

Example

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