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 college or university. The process took 2 days. I interviewed at Nagarro (Patiala)
Interview
Nagarro came to our campus for recruitment firstly there was an aptitude test if medium level followed by a technical test containing easy questions regarding basic C concepts after that written coding test. After that shortlisted students went through a technical interview which was completely focused on codes written in coding test and after that there was final round I.e HR round which had basic HR questions.
Interview questions [1]
Question 1
Print top 5 closest elements to a no. From the sorted array given.
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 college or 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.
