I applied through university. The process took 2 days. I interviewed at Nagarro (Gurgaon, Haryana) in Jun 2015
Interview
The overall interview experience was good.
Algorithm questions were normal.
Average question paper.
Face to face was good.
First round was conducted in college(30 Aptitude MCQ, 20 C/C++ MCQ, 3 Full coding question)
Second round was held at Gurgaon. (3 Coding question )
Third round was face to face technical.
Fourth round HR.
I applied through university. The process took 1 week. I interviewed at Nagarro (New Delhi) in Sept 2022
Interview
It is an oncampus opportunity, the process completes in 3 days only, 1st day- coding round ( 3 sd, 2csd)
2nd day - result of OA
3rd day - technical + HR interview
Interview questions [1]
Question 1
1. DP, GRAPH, HASHMAP, PRIORITY QUEUE questions in online test,
2. Tree, array normal question in technical interview.
5 mint hr round, basic intro(it is a non elimination round)
In first round, there was three coding question. Two of them was easy and one on recursion with medium level. then second round was technical with most of question on sorting and their time complexity ,little bit on language you choose and also you have to solve one coding problem while sharing your screen.
Interview questions [1]
Question 1
Q:Did you know about sorting ,tell about them.
Q:difference between list and tuple
I applied through university. I interviewed at Nagarro in Aug 2021
Interview
The process starts with an online round which consists of mcq questions based on aptitude which are based on maths, reasoning and puzzles followed by a technical section based on c/c++, output based, networking and dbms related questions. After this a coding round of 5 questions, 3 are for software development engineer and 2 are for commando SDE. After clearing, last was hr round.
Interview questions [1]
Question 1
Que1:Given a linked list and two integers m and n, your task is to go to mth node and delete n nodes from the link list.
Que 2: Given a array of positive and negative integers, your task was to find the two integers with maximum product in O(n) time and no extra space.
