CodingMediumcod-g484

Subject Tree dpLevel Mid–Senior~25 minCommon in Algorithms & data structures interviewsIndustries Software development

Question

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]]) → int

Examples

in[4,[[0,1,3],[1,2,4],[1,3,2]]]out7

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.

Learn the concepts

Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.

Run or narrate your approach, then ask the coach.