Round 1
Questions:
- Solve Zig-Zag Traversal of a Tree (LC Medium).
- Variation of Longest Increasing Path in a Matrix (LC Hard) with English alphabet letters instead of numbers.
Candidate's Approach
- For the Zig-Zag Traversal, I explained my approach but faced confusion when the interviewer insisted on using two queues.
- The second question was introduced with only 20 minutes left, which made it challenging to devise an efficient approach for the LC Hard problem.
Interviewer's Feedback
No feedback provided.
Round 2
Questions:
- Group Anagrams (LC Medium).
- A fairly straightforward 2D Matrix problem (LC Medium).
Candidate's Approach
Both problems were manageable, and the discussion went smoothly.
Interviewer's Feedback
No feedback provided.