Problem Description

You are given two integer arrays, query and nums.

Constraints and Assumptions

• All elements within the nums array are guaranteed to be distinct.
• Every element present in the query array is also guaranteed to exist within the nums array.

Objective

For each element x in the query array, you must find its next greater element within the nums array. The "next greater element" for x is defined as the first element to the right of x's position in nums that is strictly greater than x. If no such element exists to the right of x, then -1 should be returned for that x.

Your final output should be an array, ans, of the same length as query. Each ans[i] should correspond to the next greater element found for query[i].

Example

• query = [4, 1, 2]
• nums = [1, 3, 4, 2]
• Expected ans = [-1, 3, -1]