Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 1489. Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree
Determine which edges in a weighted undirected graph are critical (appear in every MST) or pseudo-critical (appear in some but not all MSTs) by comparing MST costs when each edge is excluded or forcibly included. This requires repeated MST computations (e.g., Kruskal with Union-Find) and careful handling of equal-weight ties.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.