Round 1: Phone Screening
Questions: A medium intervals question based on line-sweeping. The question was similar to LeetCode: Maximum Population Year with some modifications and a follow-up on space-optimization.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 2: On-site 1
Questions: A storied graph question on the shortest path from source to destination. The follow-up added a minor complication. Knowing Dijkstra's algorithm would have been enough for both questions.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 3: On-site 2
Questions: An n-ary tree traversal + top K elements question. You had to traverse an n-ary tree and fetch the top K elements based on certain conditions. The question was worded lengthily, so get used to reading long questions and understanding the crux of the problem.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 4: On-site 3
Questions: You are given a number D and a stream of numbers, where you receive one number at a time. Each time you receive a number, you must check if you can form a triplet (a, b, c) with that number and the numbers you already have such that abs(a - b), abs(b - c) and abs(c - a) are all not greater than D. If such a triplet is possible, print it and remove the numbers from future consideration.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.