Question
A network of n nodes (0..n-1) is connected by bidirectional links, each with a latency. You want to connect all nodes into one network while minimizing the single worst (maximum) latency among the links you use. Given edges as [latency, u, v], return the minimum possible value of the maximum link latency in a spanning structure that connects every node. If n <= 1 return 0; if the nodes cannot all be connected return -1.
min_bottleneck(n: int, edges: list[list[int]]) → int[4,[[1,0,1],[5,1,2],[2,2,3],[4,0,3]]]out4State 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.
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.