Round 1
Questions:
-
543: Diameter of Binary Tree
Link to problem -
498: Diagonal Traverse
Link to problem
Pretty much everything went perfectly this round, I'd say Hire/Strong Hire.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 2
Questions:
-
Modified 77: Combinations
Link to problem
(instead of n, you're given a list of numbers) -
Easier version of 23: Merge k Sorted Lists
Link to problem
(the lists are normal lists instead of LL)
The first question went well. The second question tripped me up (I originally misread the part about it being normal lists but corrected myself before I started coding). Don't actually know if my final solution had any bugs (it's a pretty long solution and it was my last interview and I was tired). Self assessment: Lean Hire/Hire.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Behavioral Round
Questions: Specific question not provided.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.