CodingHardcod-g239

Subject Bridges articulationLevel Senior–Staff~35 minCommon in Algorithms & data structures interviewsIndustries Software development

Question

You are given an undirected graph with n nodes (0..n-1) and a list of undirected edges [u, v]. A bridge is an edge whose removal increases the number of connected components. Return the total number of bridges. The graph may be disconnected and may contain parallel edges (a duplicated edge is never a bridge). Constraints: 1 <= n <= 2000.

Implement

count_bridges(n: int, edges: list[list[int]]) → int

Examples

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

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.