Filter interviews by
Find the next greater element in an array for each element
Iterate through the array and use a stack to keep track of elements
For each element, pop elements from the stack until finding a greater element
Store the next greater element in a result array
Top trending discussions
posted on 9 Oct 2021
I applied via Campus Placement and was interviewed before Oct 2020. There was 1 interview round.
I applied via Campus Placement and was interviewed before Aug 2020. There were 4 interview rounds.
Recursive functions solve problems by breaking them down into smaller subproblems, often leading to elegant solutions.
A recursive function calls itself with modified parameters.
Base case is crucial to prevent infinite recursion.
Example: Factorial function - factorial(n) = n * factorial(n-1) with base case factorial(0) = 1.
Example: Fibonacci sequence - fib(n) = fib(n-1) + fib(n-2) with base cases fib(0) = 0, fib(1) = 1.
...
posted on 1 Apr 2021
posted on 24 Mar 2021
posted on 1 Apr 2021
posted on 13 Sep 2021
I applied via Recruitment Consultant and was interviewed in Mar 2021. There was 1 interview round.
posted on 1 Apr 2021
posted on 18 May 2021
based on 1 interview experience
Business Development Executive
26
salaries
| ₹2.7 L/yr - ₹5.5 L/yr |
Software Developer
12
salaries
| ₹10 L/yr - ₹16 L/yr |
Data Scientist
10
salaries
| ₹6 L/yr - ₹11.9 L/yr |
Software Development Engineer
10
salaries
| ₹12 L/yr - ₹16 L/yr |
Assistant Manager
8
salaries
| ₹4.9 L/yr - ₹6 L/yr |
Reliance Communications
Henry Harvin Education
GAO Tek
Tata Teleservices