Question
Given a connected or disconnected undirected graph with n nodes (0..n-1) and a list of edges [u, v] (no self-loops; parallel edges may appear), count the number of bridges: edges whose removal increases the number of connected components. Use Tarjan's low-link DFS. Note that a parallel edge between two nodes means neither copy is a bridge. Assume 1 <= n <= 10000.
count_bridges(n: int, edges: list[list[int]]) → int[5,[[0,1],[1,2],[2,0],[1,3],[3,4]]]out2State 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.