Round 1: Phone Interview
Questions:
- Right Side view of the Binary tree
- Given an array with duplicates, find the local maxima
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 2: Onsite - First Interview
Questions:
- Find the unique elements in a huge array (Gave the linear search array and HashSet approach)
- Return true or false if subarray sum is found
Candidate's Approach
- For finding unique elements, the candidate suggested using a linear search combined with a HashSet.
- For the subarray sum question, no specific approach was mentioned.
Interviewer's Feedback
No feedback provided.
Round 3: Onsite - Second Interview
Questions:
- The rat and cheese question (used DFS here)
- Insert numbers in a container and compute their median (used two Priority Queues here)
Candidate's Approach
- The candidate used Depth First Search (DFS) for the rat and cheese question.
- For computing the median, the candidate implemented a solution using two Priority Queues.
Interviewer's Feedback
No feedback provided.
Round 4: Onsite - Third Interview
Questions:
- Design Instagram (Product)
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 5: Onsite - Fourth Interview
Questions: Specific question not provided.
Follow-up Questions:
- The interviewer asked the same questions framed differently multiple times, leading to confusion.
Candidate's Approach
The candidate felt that their answers were not being understood due to the interviewer's accent. They provided verbose explanations but realized the interviewer preferred concise answers without technical details.
Interviewer's Feedback
No feedback provided.