I applied through university. I interviewed at Harcourt Butler Technical University (New Delhi) in Sept 2021
Interview
In the first round there were 50 question in which 40 were completely based on C , C++ and DSA based output and conceptual questions and remaining 10 question were based on Quantitative Aptitude. I successfully cleared the first round(for that try to attempt more that 30 questions correctly)
Time duration = 50 min. + negative marking was there on MCQ questions.
In 2nd round there were 4 questions (Time duration : 75 min) . Mainly focused on dynamic programming and tree based question .In which one was output question(code of 92 lines were written and you have to write the output of that code)
Interview questions [1]
Question 1
1) Rearranging a linked list into a spiral linked list
e.g. I/P : 1->2->3->4->5->6->7
O/P : 4->3->5->2->6->1->7
2) Given a list of words , arrange them in such a way that combined they form the word which comes at the end of the dictionary formed by every possible arrangement.
e.g. I/P: ["d" , "fa"]
O/P: ["fa" , "d"]
3) Given a binary tree and linked list , return the path from the root node to a leaf node in which the linked list exists from a leaf node to a root node. It is given that the linked list will exist in the tree in exactly 1 path.