Me postulé a través de una facultad o universidad. El proceso tomó 1 día. Acudí a una entrevista en Nagarro (Nueva Delhi) en oct 2014
Entrevista
There was one Aptitude test , followed by pen-paper coding round.Anyone who attempted all the coding questions were asked to appear for interview.The interview was not much different from all the questions on written round.Just one or two different questions were asked that too were not much difficult.
Preguntas de entrevista [1]
Pregunta 1
Questions were really tough.I recommend to attempt all of those with proper logic.
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.
Me postulé en línea. El proceso tomó 1 día. Acudí a una entrevista en Nagarro (Gurgaon, Haryana) en mar 2020
Entrevista
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.
Preguntas de entrevista [1]
Pregunta 1
Written test have 3 simple questions based on DP, Hashmap, and greedy
Me postulé a través de una facultad o universidad. El proceso tomó 2 días. Acudí a una entrevista en Nagarro (Patiala) en oct 2018
Entrevista
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.
Preguntas de entrevista [1]
Pregunta 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.
