Tree diameter
Given a weighted tree with `n` nodes described by `edges` where each edge is [u, v, w], return the diameter: the maximum total edge weight on any simple path between two nodes. The tree is connected; a single node has diameter 0. Edge weights are positive.
Implement
weighted_tree_diameter(n: int, edges: list[list[int]]) → intExamples
in
[4,[[0,1,3],[1,2,4],[1,3,2]]]out7What 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,3],[1,2,4],[1,3,2]]]7not run yetsample