UBER L5

Round 1

Questions: There is a tree with each node having a value. A starts from the root and B starts from node B. Calculate the maximum points A can collect if A moves downward and B moves up with the following conditions:

1. If a node is visited by B first, A gets 0.
2. If both visit at the same time, both get half the value.

Round 2

Questions: Given a list of Managers and Reportees, write the function given below:

• Given the name of the manager, return the count of all the direct and indirect reportees.
• Add a new reportee to a manager.
• Change the manager of a given person.
• Delete any employee.