Code Room
CodingHard
Question
Given an undirected graph of n nodes (labeled 0..n-1) and a list of edges, return all articulation points (cut vertices): nodes whose removal increases the number of connected components. The graph may be disconnected. Return the node labels in ascending order.
Implement
articulation_points(n: int, edges: list[list[int]]) → list[int]Examples
in
[5,[[0,1],[1,2],[2,0],[1,3],[3,4]]]out[1,3]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.