The process was followed by 1 written and 1 group process and 3 interviews(2 tech + 1 HR).
Written test:
There were 5 questions.
1. Extended Josephus problem
2. To find errors in a given program.
3. To detect loop in a linked list.
4. Writing test cases.
5. Suggest any application for desktop.
Group process:
There were 24 students shortlisted after first round. They gave us questions on a white board. It felt like a buzzer round. questions were very easy.
1. check if a given tree is balanced or not.
2. remove duplicates in given string.
1st technical interview:(60-90min)
After the group process, they shortlisted 10 students. The first question I was given was to write code for "MemMove" function. I had not heard that function before. so I asked him to explain it. He said its similar to "memcpy". I wrote code for memcpy. Now, he said to test the code. I wrote all test cases and got the limitation of memcpy function. Now he said to code it again and i did perfectly.
The second question he asked was based on counting sort problem. that was also easy one.
2nd Technical interview:(75-90min)
6 students got selected in first interview. I was also one of them :). I was asked the following question in my second interview.
Given a binary tree (root) and two node a,b in binary tree. find the nearest ancestor between them. After solving this he changed the problem to find the sum of all elements in path from a to b. Then he said to write the test case for this problem.
3rd HR interview: (10-15min)
In HR round, interviewer asked few definitions and formulas related to graphs and trees. He checked my written again paper and asked my logic for 1st question. Then he asked about myself and some project regarding questions.
Finally I dint get selected.
The second question he asked was based on counting sort problem. that was also easy one.
2nd Technical interview:(75-90min)
6 students got selected in first interview. I was also one of them :). I was asked the following question in my second interview.
Given a binary tree (root) and two node a,b in binary tree. find the nearest ancestor between them. After solving this he changed the problem to find the sum of all elements in path from a to b. Then he said to write the test case for this problem.
3rd HR interview: (10-15min)
In HR round, interviewer asked few definitions and formulas related to graphs and trees. He checked my written again paper and asked my logic for 1st question. Then he asked about myself and some project regarding questions.
Finally I dint get selected.
No comments:
Post a Comment