CodingHard
Find Critical Edges in Minimum Spanning Tree
Filed under Uber
The question
Given an undirected weighted connected graph, identify all the critical edges in the Minimum Spanning Tree (MST). An edge is critical if deleting it increases the weight of the MST or makes the graph disconnected.
No write-up yet. Related questions below have one.
Related Uber questions
Collected from public candidate posts and coding forums. Updated Nov 2026.