Union-find (DSU): merging disjoint sets · 2 of 2
Minimum spanning trees
Connect every vertex for the lowest total weight with Kruskal’s algorithm and union-find, see why each lightest edge is safe to take, and use Prim’s algorithm when the graph is dense.
0 of 3 solved
Difficulty: how hard each problem is if its topic is new to you.
- Very EasyRelated to the lesson, but quick to solve even before reading it.
- EasyQuick once you know the topic; approachable right after the lesson.
- NormalNeeds a bit more thinking.
- HardCan take a long time to find the approach.
- Very HardChallenges strong solvers; often needs several observations beyond the lesson.
- InsaneHarder than a reasonable contest at this level would ask; leave it for later.