Given a graph of direct reports (originally, the question was posed as a graph question, but the actual structure of the graph is going to be a tree; the interviewer seemed to have gotten these two data structures confused when I clarified can a direct report have more than one manager). Each employee also has a level associated with them. Compute the maximum level-sum of a party that can be constructed from the graph. i.e. so if I am given a graph of direct reports (employee ID on top, employee level on bottom) 0 100 1 2 5 6 3 4 11 12, the maximum level score is 123 since the maximum level sum we can construct is the party that includes employees [0, 3, 4]