← Questions
Sum of distances from every node in a tree
0
I was asked this
No reports yet. Sign in to say where you were asked it.
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).
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding