Phone Screen
Questions:
- Vertical Traversal of Binary Tree
- Shortest Path in binary matrix (Path instead of length)
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Coding 1 (Strong hire / hire)
Questions:
- 129. Sum Root to Leaf Numbers -- I don't remember the follow-up.
- Minimum Flight Cost - Given two arrays find the cheapest cost - Follow up with having minimum days in between departure and arrival.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Coding 2 (Hire / lean hire)
Questions:
- Given a number and root of BST find closest number in BST.
- Merge 3 sorted arrays with no duplicates and no extra space.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Behavioral 1
Questions:
- This is for training. Found 2 interviewers. Did it good, I feel there might not be any red flags.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Behavioral 2
Questions:
- Interviewed by some VP / Director. I gave my best, didn't see any red flags here. But, the interviewers are not that friendly.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
System Design (Hire / strong hire)
Questions:
- Ad-click aggregator. Gave the solution from Hello Interview. For most of the part, I was driving the conversation. I'm stopping to see any response but, the interviewer was saying go-on. From the transition from HLD to deep-dive, I removed DB and used Flink with all the right parameters, that's the only thing he asked on why I removed DB. Gave him the explanation. This is after the layoff week, the interviewer is a bit dull and just saying go ahead.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.