Coding (Algo)

Minimum Network Connection Cost

Algorithm: Minimum spanning tree Difficulty: Medium Time: 45 minutes

Goal

Return the minimum total weight of a spanning tree or null if the sites cannot all be connected.

What this task practices

Minimum Network Connection Cost is a coding (algo) interview exercise that trains prompt interpretation, explicit assumptions, a concrete response, and a clear explanation of tradeoffs. The catalog marks it as medium difficulty. It focuses on Technical Reasoning, Testing, Validation. The signed-in workspace provides the tools for the round and evaluates the attempt against task-specific criteria. Reference solutions, hidden checks, evaluator instructions, and candidate work remain private.