It was an on campus Interview for the role of jr associate at nagaroo and it was held at college premises.
It was an on campus Interview for the role of jr associate at nagaroo and it was held at college premises.
I applied through university. The process took 1 day. I interviewed at Nagarro
Interview
It was divided into two parts: - Technical and HR. The interviews were held in the head office of Nagarro in Gurgaon on the same day and had a single interviewer each. Both the interviewers were calm, collected and patient.
Interview questions [1]
Question 1
In Technical I was asked to explain my code from the written test and a few questions on algorithms and data structures were asked, while HR interview consisted mostly of the usual HR questions i.e. why you want to join the company, where do you see yourself in 5 years from now, your strengths and weaknesses etc.
I applied online. The process took 1 day. I interviewed at Nagarro (Gurgaon, Haryana) in Mar 2020
Interview
3- Phase interview
1. Written
2.Tech
3. Hr
Written exam had 3 questions 1 easy and two moderate.
After that tech interview was one on one in which interviewer asked about approaches in the written test, Complexity and if solutions can be more efficient. After that there were few questions based on data structure and algo (not so difficult) and an introductory HR round.
Interview questions [1]
Question 1
Written test have 3 simple questions based on DP, Hashmap, and greedy
I applied through university. The process took 2 days. I interviewed at Nagarro (Patiala) in Oct 2018
Interview
There was a pen and paper round first where 3 algorithmic questions were asked. After that there were 3 rounds of interview all of which were technical. In the pen and paper round, 1 question was asked that "Given a date in dd-mm-yyyy format return the next date in same format as string.". Another question was to solve an expression and return true or false. The expression only contains true, false, brackets, or and and operator.
Interview questions [1]
Question 1
Create a stack that does push, pop and getMax operations in O(1) time. getMax should return max of all elements in the stack.
