Sum distances all nodes
Given an undirected tree with n nodes (0-indexed) as an edge list, return a list ans where ans[i] is the sum of the shortest-path distances from node i to ALL other nodes. 1 <= n <= 3*10^4, edges has n-1 entries. For n==1 return [0].
Implement
sum_of_distances(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 40 min
solution.py
InputExpectedGot
[6,[[0,1],[0,2],[2,3],[2,4],[2,5]]][8,12,6,10,10,10]not run yetsample