Round 1
Questions:
- 1 Leetcode medium
- 1 Leetcode hard, something related to monotonic stack.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 2
Questions: The problem of finding needle in a haystack (String matching). The candidate discussed the vanilla implementation and mentioned potential issues, but the interviewer was looking for a consolidated implementation that reduced the quadratic running time to linear.
Candidate's Approach
The candidate started with a vanilla implementation and discussed potential improvements using prefix-suffix preprocessing. However, the interviewer was looking for a more efficient solution.
Interviewer's Feedback
No feedback provided.
Round 3
Questions: The interviewer asked about a common problem of topological sort, referencing the Leetcode problem of Course Schedule II.
Candidate's Approach
The candidate discussed in detail how breadth-first and depth-first traversals differ and how they can be used to solve the problem. The implementation was completed successfully.
Interviewer's Feedback
The interviewer was extremely transparent with feedback and supportive throughout the process.