Min Cost to Repair Edges (Minimum Spanning Tree II)
AmazonOnline AssessmentMSTGraph
Rose Garden
GoogleOnline Assessment
Minimum Number Of Decreasing Subsequence Partitions
GoogleOnline AssessmentHardDP
Cut Binary Search Tree
AmazonTreeBSTHardLC
Subtree: Maximum Average Node
AmazonOnline AssessmentMediumTree
Fill 2D Array
GoogleOnline Assessment
Rearrange String
String
Pickup Coupon
GoogleOnline Assessment
Tree Diameter
Google
Top N Buzzwords
AmazonOnline AssessmentHOT
Load Balancer
AmazonOnline Assessment
Find Substrings
AmazonOnline AssessmentHard
Partition String
AmazonOnline AssessmentStringMedium
Find Bridges in a Graph
An edge in an undirected connected graph is a bridge if removing it disconnects the graph. Given a graph with node from 1 to n, and a list of integer pairs represent edges, return all the bridges.
Example: n = 4 edges = [[1, 2], [1, 3], [1, 4]]
Output: [[1, 2], [1, 3], [1, 4]]
Explanation: If any of the edges removed, the graph will be disconnected.