I applied through university. The process took 2 days. I interviewed at Zeus Learning Pvt. Ltd (Mumbai) in Oct 2018
Interview
I applied through college(university) on 26th of Oct 2018.
The process consisted of three rounds
1. Aptitude
2. Technical
3. Hr
Aptitude round was an online test containing 25 ques for which 60 minutes were alloted. The ques were easy but solutions was bit lengthy that's why they provided more time for 25 ques. Ques were on quant, verbal, logic.
The technical round was written test were they as u to write a logic for a problem statement
I applied through university. The process took 2 weeks. I interviewed at Zeus Learning Pvt. Ltd (Mumbai) in Jul 2019
Interview
One can apply for their interview only once an year. The interview process takes around a week. It consists of following 3 rounds:
1. Aptitude: 25 Questions all on Logical Reasoning to be solved in 1 hour. Each question carries 4 marks and no negative marking. The selection is about 10% - 15% of the total candidates.
2. Technical Coding Round: This was conducted the very next day. There were 8 questions of 2 x 1 mark, 3 x 2 marks, 2 x 3 marks, 1 x 6 marks. It was quite difficult and challenging questions. One can solve using any language. They will just check your logic not syntax.
3. F2F Technical Round: This is the final round where they ask about yourself, what you like (basically checking your communication skills). Then they can ask few codes to check logic. I could solve partially so couldn't clear the round.
Interview questions [9]
Question 1
Find the bug in code.
int sum;
for (int i=1; i<11; ++i)
sum=sum+i;
printf("%d",sum);
In an array of integers return max number of consecutive numbers whose sum is equal to number entered by user.
e.g. A = {1,2,3,3,5,6,7}
sum=6
1+2+3=6(3)
3+3=6(2)
o/p: 3
I interviewed at Zeus in September 2017. First there was online aptitude test in their office. It was very easy. Then they called me for programming test. Questions mostly Based on arrays. It was quite difficult for me. So I'm not selected.
