Round 1: Coding Round
Questions:
- Specific question not provided.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 2: Technical Interview
Questions:
- Dynamic Programming on Trees problem: Find the maximum sum of nodes in a tree such that no two adjacent nodes are included.
Candidate's Approach
The candidate explained the approach, wrote the code, and dry-ran the code for the given test cases. This question took around 45 minutes as significant time was spent on dry-running the test cases.
Interviewer's Feedback
The interviewers were impressed with the candidate's introduction, describing it as creative and unique. They mentioned that it was fun interviewing the candidate and expressed satisfaction with the responses given, despite some confusion on 2-3 questions.