This was a coding round in which everyone(CSE, ECE, EEE, MNC) with CPI>=7 were eligible to appear. There was only one question was given to be solved in 3 hours. STL was not allowed. The question was simple logic and implementation type. There was limit on number of submissions to 3. So, make sure all of your corner cases be correct. Rather, you can compile and test infinite times. Solving early was not much concern for them. Just make sure you do that correctly.
Students whose all test cases passed and CPI >=7.5 were shortlisted for interview. A total of 36 were selected and sorted according to CPI.
Interview Duration: 35 Minutes
The interviews process started at 7 p.m. on following day and went till 2 a.m..
This was a technical round. The interviewer went through my resume for 2 minutes. Then she asked me about my favorite data structure. I told her Hashing and Linked list. Then she me two questions on binary tree.
I first explained her the logic then she asked to write full code for it.
Q.2) Find Lowest Common Ancestor in Binary Tree without using extra space. https://www.geeksforgeeks.org/lowest-common-ancestor-in-a-binary-search-tree/
Then she asked me if I know about structure padding. I told her I hadn’t heard about it. Then she asked me storage class in C, Virtual Function, Run-time Polymorphism, etc. in OOPs.
She was pretty satisfied with all of my answers and asked me if I had any question for her.
This was a very short round. He just went through my resume and asked me to explain one of my projects.