Round 1
Questions:
- Question:
- 238 (with space complexity O(min(n,k)))
- Contains Duplicate II
- Question:
- The second was untagged, not even in Leetcode, merge 3 sorted arrays (similar to merge k sorted lists).
- Merge k Sorted Lists
Candidate's Approach
- For the first question, the interviewer did not want to accept an O(n) space complexity solution using a map, which led to a time-consuming discussion.
- For the second question, the candidate suggested using a PriorityQueue but did not have enough time to elaborate further.
Interviewer's Feedback
No feedback provided.