Tree diameter maximum weight path
Given a weighted tree with n nodes (0-indexed) as an edge list of [u, v, w], return the diameter: the maximum total weight of any simple path between two nodes. 1 <= n <= 5000, 1 <= w <= 1000. For n==1 the diameter is 0.
Implement
tree_diameter(n: int, edges: list[list[int]]) → intExamples
in
[4,[[0,1,1],[1,2,1],[1,3,1]]]out2What 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 25 min
solution.py
InputExpectedGot
[4,[[0,1,1],[1,2,1],[1,3,1]]]2not run yetsample