LeetCode - Next Greater Element 1 Solution - The Coding Shala
Home >> LeetCode >> next greater element 1
In this post, we will learn how to solve LeetCode's Next Greater Element 1 problem and will implement its solution in Java.
Next Greater Element 1 Problem
You are given two arrays (without duplicates) nums1 and nums2 where nums1’s elements are a subset of nums2. Find all the next greater numbers for nums1's elements in the corresponding places of nums2.
The Next Greater Number of a number x in nums1 is the first greater number to its right in nums2. If it does not exist, output -1 for this number.
Input: nums1 = [4,1,2], nums2 = [1,3,4,2].
Explanation: For number 4 in the first array, you cannot find the next greater number for it in the second array, so output -1.
For number 1 in the first array, the next greater number for it in the second array is 3.
For number 2 in the first array, there is no next greater number for it in the second array, so output -1.
Next Greater Element 1 java solution
We can solve this problem using brute force. The time limit will be O(n^2).
Other Posts You May Like
- LeetCode - Contains Duplicate
- LeetCode - Jewels and Stones
- LeetCode - Swap Nodes in pairs
- LeetCode - Climbing Stairs
- LeetCode - Bulb Switcher