There was an initial online assessment (OA) to shortlist candidates, followed by two technical interview rounds and an HR round.

The OA had four questions, randomly selected from a question bank of 15. The OA was for 70 minutes. Solving it quickly was an important factor for getting shortlisted, along with a good CGPA.

The two technical rounds followed the same procedure: an interviewer explained the process, followed by a brief introduction from both me and the interviewer, and then the coding portion of the interview. There was one question, with follow-ups that were harder than the base question. We were required to explain our logic first. If it was the best algorithm, we proceeded with coding the question. Otherwise, the interviewer communicated where the algorithm needed modification to make it better, and those modifications had to be made.

The HR round focused on the CV and the interviewer assessing my fit within their work environment.

How would you proceed if you were given a new concept to learn? (HR round)

There is a tree, with all edges given. The target nodes for a person, starting from the root node, are provided in a list of vertices. What is the minimum distance to visit all target nodes and return to the root node?

Follow-up: There are two friends, each with their own independent set of target nodes. What is the minimum total distance traveled by both friends (distance of friend 1 + distance of friend 2) to visit their respective target nodes? This is given that at any point in time, the maximum distance one person can be from the other is the length of one edge. If a person is in node X, the other person can be in the same node, its parent, or one of its children.

Additional follow-up: This scenario is the same as the follow-up above, but the maximum distance between the two friends should be at most K (an integer K is given).