GL
GrindLens
PatternsSheetsPricingQuestions
  1. Home
  2. /Sheets
  3. /NeetCode 150
  4. /Minimum Spanning Tree (Prim's/Kruskal's)
←Back to NeetCode 150
Curated IntersectionSheet: NeetCode 150Pattern: Minimum Spanning Tree (Prim's/Kruskal's)

NeetCode 150 · Minimum Spanning Tree (Prim's/Kruskal's)

Build a minimum-weight tree connecting all nodes, either by growing from a frontier (Prim's) or sorting edges and using union-find (Kruskal's).

Sheet Problems: 1
Category: Graphs
ℹ

Curated selection from NeetCode 150

This sheet features 1 problem testing this technique. For the complete collection of problems and detailed algorithmic intuition, visit the Minimum Spanning Tree (Prim's/Kruskal's) Pattern Guide.

Featured Problems (1)

1.Min Cost to Connect All PointsMedium
Solve↗

Explore More Patterns in NeetCode 150

Track your progress across all 150 problems in this curriculum roadmap.

Back to NeetCode 150Minimum Spanning Tree (Prim's/Kruskal's) Pattern Guide
GL
GrindLens

Precision pattern analytics and curated sheet tracking for algorithmic coding interview preparation.

Quick lookup:⌘Kor/

Platform

  • Patterns→
  • Sheets→
  • Pricing→

Community

  • Feedback
  • Report a bug
  • X
  • LinkedIn

© 2026 GrindLens. LeetCode is a trademark of LeetCode. GrindLens is an independent analytics platform and is not affiliated with or endorsed by LeetCode.

Terms of ServicePrivacy Policy