Ho presentato la mia candidatura tramite l'università. La procedura ha richiesto 2 giorni. Ho sostenuto un colloquio presso Nagarro (Nuova Delhi)
Colloquio
Day 1-
Aptitude + C (MCQ's) - Elimination (Difficult) Written
Day 2-
Data Structures (3 Coding questions) - Non-Elimination (Average-Difficult) written
Technical Interview based on Coding Questions - Elimination (Average)
HR Interview - Elimination (Easy)
Domande di colloquio [1]
Domanda 1
Coding questions were somewhat from GeeksForGeeks.
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.
Ho presentato la mia candidatura online. La procedura ha richiesto un giorno. Ho sostenuto un colloquio presso Nagarro (Gurgaon, Haryana) nel mese di mar 2020
Colloquio
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.
Domande di colloquio [1]
Domanda 1
Written test have 3 simple questions based on DP, Hashmap, and greedy
Ho presentato la mia candidatura tramite l'università. La procedura ha richiesto 2 giorni. Ho sostenuto un colloquio presso Nagarro (Patiala) nel mese di ott 2018
Colloquio
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.
Domande di colloquio [1]
Domanda 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.