You are given n computers labeled from $0$ to $n - 1$ and a list connections, where each element connections[i] = [a_i, b_i] represents a cable directly connecting computers a_i and b_i.

A cable can be removed from its current pair of computers and reconnected between any two computers.

Return the minimum number of such cable move operations needed to make all n computers part of a single connected network. If it is impossible to connect all computers, return $-1$.

Constraints:

• $1 \leq$ n $\leq 10^5$

• $1 \leq$ connections.length $\leq \min\left(\frac{`n` \cdot (`n` - 1)}{2}, 10^5\right)$

• connections[i].length $== 2$

• $0 \leq$ a_i, b_i $<$ n

• a_i $\neq$ b_i

• There are no repeated connections.

• No two computers are connected by more than one cable.

Input: n = 5-int, connections = [[0,1],[1,2],[2,0],[3,4]]-List[List[int]]
Output: 1-int
Explanation: There are two connected components, {0,1,2} and {3,4}. The edge [2,0] is redundant because {0,1,2} stays connected without it (it forms a cycle), so moving that cable to connect the two components (e.g., connecting 2 to 3) takes 1 operation.

Input: n = 4-int, connections = [[0,1],[2,3],[1,2]]-List[List[int]]
Output: 0-int
Explanation: All computers are already connected through the chain 0-1-2-3, so no cable moves are needed.

Input: n = 7-int, connections = [[0,1],[1,2],[2,3],[3,0],[4,5],[5,6]]-List[List[int]]
Output: 1-int
Explanation: The network has two components, {0,1,2,3} and {4,5,6}. Inside {0,1,2,3}, the edge [3,0] is redundant (it creates a cycle), so moving that cable to connect the components (e.g., connecting 3 to 4) takes a minimum of 1 operation.

Input: n = 8-int, connections = [[0,1],[1,2],[2,0],[3,4],[4,5],[5,3],[6,7]]-List[List[int]]
Output: 2-int
Explanation: There are three components: {0,1,2}, {3,4,5}, and {6,7}. Each of the first two contains a cycle, so each has one redundant cable ([2,0] and [5,3]). Using those two spare cables connects the three components into one (needing components - 1 = 3 - 1 = 2 connections), so the answer is 2.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.