Tip 1 : Practice on a daily basis
Tip 2 : Don't take long breaks from practicing DSA.
Tip 3 : Do not ignore core engineering subjects
Tip 1 : Do not put false things.
Tip 2 : Try to add projects that you are fully capable of explaining
Tip 3 : Make it a single-page resume



Input: 'a' = [7, 12, 1, 20]
Output: NGE = [12, 20, 20, -1]
Explanation: For the given array,
- The next greater element for 7 is 12.
- The next greater element for 12 is 20.
- The next greater element for 1 is 20.
- There is no greater element for 20 on the right side. So we consider NGE as -1.



Input: Let the binary tree be:

Output: [10, 4, 2, 1, 3, 6]
Explanation: Consider the vertical lines in the figure. The top view contains the topmost node from each vertical line.
Technical round 2nd + HR Round


Why should we hire you?
What are your strengths?
How according to you one should handle obstacles in his professional career?

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
What is recursion?