Round 1
Questions:
- Find the Next Greater Element (NGE) for every element in a given array.
- Specific question not provided, but it involved some typical DSA concepts.
- A problem involving trains at a railway station with varying arrival times, some cancelled or delayed. I was asked which data structure would be most suitable for solving this problem and why.
- The Coin Change problem: I was asked for the approach to solving it.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 2
Questions:
- Given a postorder traversal of a Binary Search Tree (BST), convert it back into a normal BST.
- A HLD problem related to Swiggy. (They wanted to test my understanding of HLD, and how to apply it in a practical scenario.)
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 3
Questions:
- OYO DB Design: I was asked to design a database for a hotel booking system.
- The Stock Buy and Sell Problem: I was asked to provide an efficient approach to solve this problem.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Verdict: Selected
Compensation Details: ServiceNow Compensation Discussion