Leetcode 1135. Connecting Cities With Minimum Cost

Given n cities and a list of undirected weighted connections, find the minimum total cost to connect all cities (or return -1 if it's impossible). The core challenge is computing a minimum spanning tree (MST), typically solved with Kruskal/Prim and union-find to ensure full connectivity.