Round 1
Questions:
Test Cases for Subarray Sum Equals K:
- Specific test cases not provided.
Candidate's Approach
- For the Subarray Sum Equals K problem, the candidate was able to solve it completely and provided the answers.
- For the Lowest Common Ancestor problem, the candidate received an n-ary tree and was unable to come up with a complete solution. They discussed the interviewer's approach, which involved using a set to find paths and checking if both trees were found.
Interviewer's Feedback
No feedback provided.