Phone interview round with one of the software engineers working in the Engineering Development group team.

The first round was based on explaining assessment questions and solving a graph question, which was to be solved using a Codepair platform.

Online assessment coding questions' code was asked to explain in detail and come up with any optimization for your written solution.

Question: Minimum Cost Tree From Leaf Values.

Questions: 2. Write the code for a graph problem.

There are n computers numbered from 0 to n-1 connected by ethernet cables, forming a network where connections[i] = [a, b] represents a connection between computers a and b. Any computer can reach any other computer directly or indirectly through the network.

Given an initial computer network connections, you can extract certain cables between two directly connected computers and place them between any pair of disconnected computers to make them directly connected. Return the minimum number of times you need to do this in order to make all the computers connected. If it's not possible, return -1.