Round 1
Questions: Standard BFS in a matrix problem with obstacles.
- Discussed edge cases and approaches but couldn’t fully solve it due to time constraints.
- Interviewer asked to skip coding due to time.
Candidate's Approach
- Solved the main problem efficiently and wrote clean code.
- Discussed time complexity but felt less confident about it.
Interviewer's Feedback
- Interviewer seemed happy with the initial solution but noted the time constraints affected the follow-up discussion.
Round 2
Questions: Problem involving an optimal solution with a queue.
Candidate's Approach
- Solved the problem optimally within time.
- Identified and fixed a minor bug during the dry run (pushing to the queue after popping).
- Handled a small syntax mistake.
Interviewer's Feedback
- Interviewer seemed satisfied with the solution and the handling of the bug.
Round 3
Questions: A variation of the N-Queens problem.
Candidate's Approach
- Solved the main problem within time.
- Answered minor questions like handling a sparse matrix.
Interviewer's Feedback
- Interviewer seemed happy and satisfied with the solution.