Round 1
Questions:
-
Merge 3 sorted Arrays, result should not contain duplicates. Follow-up: Merge k sorted arrays (did not need to code the follow-up, just walked through the solution).
-
K closest points to the origin. Coded up the quicksort solution.
Candidate's Approach
For the first question, the candidate discussed the approach to merge three sorted arrays while ensuring that the result does not contain duplicates. They walked through the logic for merging k sorted arrays without coding it.
For the second question, the candidate implemented a quicksort solution to find the k closest points to the origin.
Interviewer's Feedback
No feedback provided.