Problem - Sum of Distances in Tree (LeetCode 834)

LeetCode $834$ is the same problem as CSES Tree Distances II with a different interface. You get an integer $n$ and an array of edges. Return an array where answer[i] is the sum of distances from node $i$ to all other nodes.

The difference from CSES: LeetCode uses $0$-indexed nodes (nodes $0$ through $n-1$), while CSES uses $1$-indexed. Your rerooting logic stays identical. You only change the loop bounds and array indexing.

Try implementing the two-pass solution. Root at node $0$, compute subtree sizes and distance sums in the down pass, then reroot in the up pass.