The interview process consisted of three rounds. Two were technical rounds, and the third was with the hiring manager. All of the rounds took place via online video conference.

The format of the interview was as follows:

1. Data structures and algorithms questions.
2. Problem-solving combined with Java questions.
3. Hiring manager interview.

1. Basic questions related to data structures and algorithms:

   • Binary Search Tree: How it works.
   • Linked List: Insert element, reverse linked list.
   • Tree: Zigzag traversal.
   • Array: Merge two arrays.

2. Problem-solving round: A company organizes two foreign trips for its employees yearly. The aim of the trips is to increase interaction among employees. Therefore, the company wants each employee to meet new people on the trip and not anyone with whom they have worked in the past. It is a rule in the company that in any of the trips, all employees should be new to each other, and no two of them should have worked together in the past. Given the work history of each employee (which people they have worked with in the past), tell whether all employees can be accommodated within the trips without violating this rule. Each employee is given a unique integer ID. Assume that each employee has worked with at least one other employee in the past.