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.
Return an array ans of length nums1.length such that ans[i] is the next greater element as described above.
Key Insight: Use a monotonic decreasing stack on nums2. When we pop an element, we have found its next greater element. Store results in a hash map for O(1) lookup when processing nums1.
nums1 = [4,1,2], nums2 = [1,3,4,2][-1,3,-1]nums1 = [2,4], nums2 = [1,2,3,4][3,-1]1 <= nums1.length <= nums2.length <= 10000 <= nums1[i], nums2[i] <= 10^4All integers in nums1 and nums2 are uniqueAll the integers of nums1 also appear in nums2Click "Run" to execute your code against test cases
Socratic guidance - I'll ask questions, not give answers