Screening Round
Questions:
- Merge Sorted Array
- Graph BFS with min steps to reach land from starting pos
Candidate's Approach
- For the first question, the candidate used a two-pointer approach and explained it well.
- For the follow-up question regarding input as a list of arrays, the candidate attempted to use a pointer approach for each array, resulting in a time complexity of O(n*m), where n is the sum of the lengths of each array and m is the number of arrays. The candidate felt this was not the best solution.
- The second problem was solved and explained without issues.
Interviewer's Feedback
No feedback provided.