Envié una solicitud electrónica. Acudí a una entrevista en Nagarro (Nueva Delhi) en ago 2017
Entrevista
hii gyus i have attend the nagarro off campus drive 19 august 2017.
Interview was good. but Important thing thing that 50 questions is arithmetic aptitude to solve in 40 minuses after that 20 question c language find output . Aptitude is difficult
so be prepare for first round arithmetic .Some apptitude question is indiabix and c questions also if you give interview in nagarro plz do indiabix aptitude and c program.
Nagarro also arrange the set a,b,c for questions
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.
Envié una solicitud electrónica. El proceso duró 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
Solicité el puesto a través de la escuela superior o la universidad. El proceso duró 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.
