YOE: 6.5

Sharing question below

Uber
round 1:

there is a tree with each node having value. A starts from root and B starts from node B.
calcuate the maximum point A can collect if A moves downward and B moves up with below condition

1. if node is visited by B first, A gets 0 and vice versa 2.
2. if both visits at the same time, both gets half value

Uber round 2:
Given a list of Managers and Reportees, write the function given below.
Given the name of the manager, return count of all the direct and indirect reportee
Add a new reportee to a manager
Change the manager of given person
Delete any employee

Remaining round in progress. will share the experience in due time.

thanks.