Round 1
Questions:
- Specific question not provided. However, it was described as a LeetCode hard question with numerous edge cases that does not require fancy data structures or algorithms.
- Specific question not provided. It was described as a LeetCode medium question that is implementation heavy, with two possible solutions: DFS and union-find.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.