There were 10 MCQ questions based on conceptual understanding and aptitude. Further there were 3 coding questions based on graphs and dynamic programming. At the end there were two personality questions too in which we had to mention our views about the given statement.

Puzzles and array based questions were asked.

Questions related to merge sort and variations in it were asked. Dynamic programming based questions were also asked.Further questions were based on the projects mentioned in the resume.

Interview started with algorithm for Kth smallest element in array and further heap sort was asked in depth. The time complexity and space complexity were also asked at each step and further questions involved use of stacks and writing the code for it.

The hard copies of computer based test were available with the interviewers so this test should be given seriously as they referred these hard copies during the interview.