Minimum spanning tree coding challenges

Practise minimum spanning tree with 1 coding challenges, from easy to hard. Every challenge runs in your browser with instant tests, an AI review of your code and community solutions to compare.

Hard · 1

Skills you'll practise: Kruskal's algorithmUnion-find
  • Python · C++ · C#
  • Automated tests
  • AI code review
  • Community solutions
226
Challenges
2
Solutions shared
3
Languages

All challenges

Search by topic, language, or difficulty.

1 challenge
Hard

Minimum Network Connection Cost

Choose undirected links so that every vertex can reach every other vertex, with minimum total cost.

You'll learn Kruskal's algorithmUnion-find
Disjoint-setsGraphsMinimum-spanning-tree
No solutions yet