Round 1
Questions:
Specific question not provided.
Candidate's Approach
The candidate implemented a solution using Depth First Search (DFS) to traverse the tree structure. The approach involved creating a graph representation of the tree using an adjacency list. The candidate maintained a dynamic programming (DP) table to store the maximum sums for each node, considering whether the node is included or excluded in the sum. The DFS function was called recursively to calculate these values for each node, ensuring that the parent node was not revisited.
Interviewer's Feedback
No feedback provided.