##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
The core idea
You need at least n−1 cables to connect n computers. If you have fewer cables, return −1.
Count connected components using Union-Find. To merge k components into one, you need k−1 operations (move one redundant cable per merge).
The answer is simply: number of components minus 1.
