Sum of distances from every node in a tree
Given an undirected tree with n nodes, return for every node the sum of its distances to all other nodes. A BFS from every node is too slow; compute it in linear time with two passes (subtree sizes, then rerooting).
GoogleTechnical phone screenNo answer yet. Write the first one; the best answer gets endorsed.