Round 1
Questions:
- Matching characters in a substring (Leetcode Easy)
- Allocating mailboxes with n mailboxes (Leetcode Hard)
Candidate's Approach
- For the first question, the candidate passed all test cases except one hidden case and was unable to identify the issue.
- The candidate had around 25 minutes left for the second question after spending time on the first question but ultimately failed to solve it due to time constraints. They noted that a binary search with a greedy approach was likely needed.
Interviewer's Feedback
No feedback provided.