First round was mainly technical, predicting the output. Only 3 aptitude based questions and 1 Programming question.
-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
Second round started with
1) Tell me about yourself.
2) What projects have done in Engineering ?
3) Write the algorithm to find the maximum sub sequence sum in a array which contains both +ve and -ve numbers.
--> Started with a trivial O(n2) solution.
--> Recursive solution.
4) Given a array of infinite size, and there is a window of size k. Which is moving in this array :
Eg :
<-- 2 || 3 4 5 6 || 10 11 9 ---->
here array is
<-- 2 3 4 5 6 10 11 9 ---->
Each step the window moved in the following manner :
<-- 2 || 3 4 5 6 || 10 11 9 ---->
<-- 2 3 || 4 5 6 10 || 11 9 ---->
<-- 2 3 4 || 5 6 10 11 || 9 ---->
Explain a efficient algorithm using a good data structure to find the maximum number in the window effectively? After i explained he asked me to code the algorithm.
------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
Third round : This session was more like a conversation.
1) Tell me about yourself.
2) Explain your research papers.
3) You are told to design a online Cards game..how would you go about doing it ? What data structure are you going to use it ? You know that for playing any card games we shuffle the cards. How will one do that ? Write a code to do the same.
4) Do you know about deep copy and shallow copy. Design a algorithm to do a deep copy of a tree ! Write the code to do the same.
NO HR round.
