You are given an integer n, representing the number of nodes in an undirected graph with nodes numbered from $0$ to n $- 1$. You are also given an integer k and a $2$D integer array edges, where edges[i] $= [u_i, v_i, time_i]$ indicates that an undirected edge connects node $u_i$ and node $v_i$, which gets removed at time $time_i$.

At time $0$, all edges in edges exist in the graph. As time increases, each edge is removed at its designated time.

Return the minimum time needed for the graph to contain at least k connected components.

Constraints:

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

• $0 \leq$ edges.length $\leq 10^5$

• edges[i] $= [u_i, v_i, time_i]$

• $0 \leq u_i, v_i <$ n

• $u_i \neq v_i$

• $1 \leq time_i \leq 10^9$

• $1 \leq$ k $\leq$ n

• There are no duplicate edges.

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.