Round 1: Coding Round
Questions:
- Given the root of a binary tree, return the vertical order traversal of its nodes' values. (i.e., from top to bottom, column by column). If two nodes are in the same row and column, the order should be from left to right.
- Leetcode Problem: Merge K Sorted Lists - for three lists and not k. You cannot use extra space or data structures apart from variables.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 2: Coding Round
Questions:
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 3: System Design
Questions:
- Design an ad click aggregator system.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 4: System Design
Questions:
- Design how you would handle peak traffic for an event booking platform for large events.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 5: Behavioral Round
Questions:
- Questions about your past experience. Do not remember them exactly.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Final Update: Rejected.