Tree distance sum
Given an unrooted tree with `n` nodes and edge list `edges`, return a list `res` where res[i] is the sum of the distances (number of edges) from node i to every other node. Solve it in linear time, not O(n^2). The tree is connected.
Implement
sum_of_distances_in_tree(n: int, edges: list[list[int]]) → list[int]Examples
in
[6,[[0,1],[0,2],[2,3],[2,4],[2,5]]]out[8,12,6,10,10,10]What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 35 min
solution.py
InputExpectedGot
[6,[[0,1],[0,2],[2,3],[2,4],[2,5]]][8,12,6,10,10,10]not run yetsample