J'ai postulé via un établissement d'enseignement supérieur ou universitaire. Le processus a pris 2 semaines. J'ai passé un entretien chez Nagarro en mai 2014
Entretien
interview process consists of four rounds:
1. written test which includes aptitude(60 minutes) + coding(75 minutes)
2. written coding test at nagarro office, test is of 75 minutes.
3. Technical Interview in which they asked question based on code written.
4. HR interview
Questions d'entretien [1]
Question 1
In coding they look for logic but not for syntax. so write optimized code and be ready to explain it.
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.
J'ai postulé en ligne. Le processus a pris 1 jour. J'ai passé un entretien chez Nagarro (Gurgaon, Haryana) en mars 2020
Entretien
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.
Questions d'entretien [1]
Question 1
Written test have 3 simple questions based on DP, Hashmap, and greedy
J'ai postulé via un établissement d'enseignement supérieur ou universitaire. Le processus a pris 2 jours. J'ai passé un entretien chez Nagarro (Patiala) en oct. 2018
Entretien
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.
Questions d'entretien [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.
