Question
Given an undirected graph with n nodes (0..n-1) and a list of edges [u, v], count the number of articulation points (cut vertices): vertices whose removal increases the number of connected components. Handle the DFS-root special case correctly (a root is an articulation point iff it has more than one DFS child). Assume 1 <= n <= 10000; the graph may be disconnected.
count_articulation_points(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.