minimum spanning tree

3 problems

Easy: 0Medium: 1Hard: 2

minimum spanning tree is one of the most repeated interview dimensions. Start with edge-safe fundamentals, then move into pattern-level trade-offs.

Interview Signal

Frequently tests problem modeling, edge handling, and verbal clarity.

Template-only answers break under follow-up questioning.

Practice in 3-5 problem rounds and always review complexity alternatives.

Foundation

Pattern Bridge

High-Pressure Round

Problem bank

Start with a compact scan-friendly list and progressively load more so the topic page stays readable even when the corpus is large.

Progressive topic library

Built for large topic sets: scan the structure first, then go deeper.

hourglass_bottomScroll to continue

tuneDifficulty

Showing 3 / 3 problems

#TitleDifficultyCategory

Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree

Identify critical and pseudo-critical edges in a weighted graph's minimum spanning tree using Union Find efficiently.

Min Cost to Connect All Points

Min Cost to Connect All Points asks for the minimum cost to connect all points on a 2D plane, using manhattan distances …

Maximize Spanning Tree Stability with Upgrades

Maximizing the stability of a spanning tree with upgrades requires careful optimization of edge strengths using binary s…

Union Find plus Graph

2 linked problems

Binary search over the valid answer space

1 linked problems