Next Greater Element Problem Statement
You are given an array arr
of length N
. For each element in the array, find the next greater element (NGE) that appears to the right. If there is no such greater element, return -1.
Input:
T
N
arr[0] arr[1] ... arr[N-1]
Output:
NGE[0] NGE[1] ... NGE[N-1]
Example:
Input:
1
3
1 3 2
Output:
3 -1 -1
Explanation:
For 1
, 3
is the next greater element. 3
has no greater element to its right, so it returns -1
. Similarly, 2
also returns -1
.
Constraints:
1 <= T <= 10
1 <= N <= 10^5
0 <= arr[i] <= 10^9
- Time Limit:
1 sec
Note:
Implement the function without printing anything; printing is already handled.

AnswerBot
4mo
The task is to find the next greater element for each element in an array to its right, if no greater element exists, return -1.
Use a stack to keep track of elements for which the next greater element...read more
Help your peers!
Add answer anonymously...
Cisco Software Engineer interview questions & answers
A Software Engineer was asked 8mo agoQ. Given an array, find the next greater element (NGE) for every element. The Next ...read more
A Software Engineer was asked 8mo agoQ. Design a multi-user job scheduler.
A Software Engineer was asked 9mo agoQ. Given a string s, find the length of the longest subsequence that is lexicograph...read more
Popular interview questions of Software Engineer
A Software Engineer was asked 8mo agoQ1. Given an array, find the next greater element (NGE) for every element. The Next ...read more
A Software Engineer was asked 8mo agoQ2. Design a multi-user job scheduler.
A Software Engineer was asked 9mo agoQ3. Given a string s, find the length of the longest subsequence that is lexicograph...read more
Stay ahead in your career. Get AmbitionBox app


Trusted by over 1.5 Crore job seekers to find their right fit company
80 L+
Reviews
10L+
Interviews
4 Cr+
Salaries
1.5 Cr+
Users
Contribute to help millions
AmbitionBox Awards
Get AmbitionBox app

