Technical interviews were really good. The main focus was on your approach to finding a solution.

They gave sufficient time to think, so it's better not to hurry and to think properly before proposing a solution. Keep communicating and sharing your thoughts with the interviewer, and write clean code.

The papers on which I wrote code, along with the interviewer's remarks, were passed on to the next interviewer.

There was no bias based on branch or CGPA. You don’t need to study any other courses that I have not mentioned above.

I suggest you ask some questions to the interviewer at the end of the interview about some work in the organization or the department you would be offered if you got selected. This shows that you are seriously interested in working for their organization and increases your chances of getting selected.

All the best.

In the first technical interview, two questions were asked.

The first was an easy dynamic programming question.

The second question involved a family tree. For each node, the name and gender were given. Nodes at the same level denote siblings based on their gender. The first part of the question required answering ancestor-descendant relationship queries in O(1) time.

The second part presented a query with a name and a relationship (e.g., Rahul and brother). The task was to print all of Rahul's brothers. The relationship could be any, such as brother, sister, father, mother, grandfather, great-grandfather, etc. This had to be done in the most optimal way, with the entire code written on paper.

In the second technical interview, one question on data structures and algorithms (DSA) was asked.

The question was to use an appropriate data structure to check for errors in an HTML document. Errors could include spelling mistakes, missing closing tags, closing tags before opening tags, or incorrect tag ordering. The interviewer clearly explained how an HTML document is written. The candidate had to identify possible errors and specify which errors their solution covered, aiming for the most optimal solution.

Initially, a solution using two data structures was proposed. Upon further instruction to optimize, the requirement became to use only one data structure that could cover all test cases. The entire code had to be written on paper.

Following this, the interviewer asked about a strong subject other than DSA, and the candidate chose Operating Systems.

A question on OS was then posed. It was a simple scenario: given two CPUs, different processes with their arrival times, burst times, etc., the task was to schedule the processes using any scheduling algorithm. The candidate had to decide which algorithm would be best for the case, schedule them, and justify the choice over other algorithms.