Round 1
Questions:
- Leadership principle questions (specific questions not provided).
- Coding question: All Nodes Distance K in Binary Tree
Candidate's Approach
I provided a solution with time complexity O(V+E) and space complexities of O(n), O(E), and O(h). However, the interviewer insisted on an O(1) space solution, and despite hints, I could not arrive at the optimized solution.
Interviewer's Feedback
No feedback provided.
Round 2
Questions:
- Leadership questions:
- Any challenge project
- Time when learned new things and implemented in project
- Beyond your scope of work
- Coding question: Top K Frequent Words
Candidate's Approach
I initially provided a brute force solution for the coding question, followed by the most optimized solution.
Interviewer's Feedback
No feedback provided.