Given an undirected graph, find out all the vertices when removed will make the graph disconnected. Initially the graph is connected.
For example given the graph below:
Return [3, 6]. Because we can make the graph disconnected by removing either vertex 3 or vertex 6.
nodeNum, the total count of vertices in the graph. Each vertex has an unique id in the range from 0 to nodeNum - 1 inclusive.
edges, a list of integer pairs representing all the edges on the graph.
A list of integers representing the ids of the articulation points.
nodeNum = 7
edges = [[0,1], [0, 2], [1, 3], [2, 3], [2, 5], [5, 6], [3,4]]
Learn from Facebook, Google, Uber senior engineers interviewed 100+ candidates.aonecode.com
Most recent interview questions and system design topics gathered from aonecode alumnus.
One-to-one online classes. Get feedbacks from real interviewers.
Already a coding expert? - Advance straight to hard interview topics of your interest.
New to the ground? - Develop basic coding skills with your own designated mentor.
Days before interview? - Focus on most important problems in target company question bank.