In 1st technical interview 2 questions were asked. First one was an easy dp question. The 2nd question was that you have been given a family tree. For each node, name and its gender would be given. The nodes at same level denote brother/ sister depending on its gender which would be given. The first part of the question is to answer ancestor descendent relationship query in O(1). In 2nd part you have been given a query denoting name and its relationship. For e.g. Rahul and brother. Now, you have to print all the brothers of Rahul. The relationship can be anything like brother, sister, father, mother, grandfather, grand grandfather etc. You have do it in the most optimal way. You have to write the whole code on paper.• In 2nd technical interview, 1 question was asked on dsa. The question was that you have to use an appropriate data structure to check any error in an html document. The error can be anything like spelling mistake, not writing closing tag, writing closing tag before opening tag, wrong ordering of tags etc. (can be anything). The interviewer clearly explains how an html document is written. You have to identify possible errors yourself and what errors are you covering in your solution. You have to give the most optimal solution. Firstly, I proposed a solution using 2 data structures. Then, I was told to optimize it more and use only 1 data structure that cover all the test cases. You have to write the whole code on paper. Then, the interviewer asked me about my strong subject other than dsa and I chose operating system. Then, she asked a question on os. It was a simple question. You have been given 2 cpu’s, different processes, their arrival time, burst time etc. You have to schedule the processes by using any scheduling algorithm. You have to decide which scheduling algorithm would be best for that case, schedule them and justify why you chose that scheduling algorithm and not others.