Round 1: Mock Interview with Googler
Questions: Was asked an interval-based question with simple follow-ups and was able to solve it on time. Got some feedback on coding speed and readability.
Candidate's Approach
No approach provided.
Interviewer's Feedback
Feedback focused on coding speed and readability.
Round 2: 1st Coding Round
Questions: Was asked a question similar to LC: 406 but with a different story and additional limitations and ambiguity.
Candidate's Approach
- Asked a lot of clarifying questions.
- Tried very hard but couldn't figure out the right data structure and algorithm to solve the problem.
- Ended up solving it with a time complexity of O(n log n + n^2) and dry ran the code.
Interviewer's Feedback
Feedback was positive, indicating "Hire".
Round 3: 2nd Coding Round
Questions: Was asked a tree-based question to apply some operations using two trees at the same levels.
Candidate's Approach
- Solved the complete problem in an optimal way and covered all edge cases.
- Missed the level constraints and directly applied the operations instead of checking for levels.
- Explained the fix verbally towards the end of the interview due to time constraints.
Interviewer's Feedback
Feedback was negative, indicating "No Hire".
Round 4: 3rd Coding Round
Questions: Was asked a tree-based question again which involved BFS and min heap.
Candidate's Approach
- Took a lot of time and got stuck on one of the conditions while coding.
Interviewer's Feedback
Feedback was positive, indicating "Hire".
Overall Feedback
- Not proceeding to HC due to round 2 feedback.
- The recruiter mentioned that the candidate was very close to getting hired and performed well overall, with many positives noted in the feedback.
- The recruiter stated they would contact the candidate again for a re-interview after 3 months.