Ho presentato la mia candidatura tramite l'università. Ho sostenuto un colloquio presso Nagarro (Mumbai) nel mese di gen 2016
Colloquio
The interview was difficult. Was asked about the different coding question and initial rounds were aptitude round. It contained basic Maths questions and Logical Reasoning. Also, have 3 coding questions whose algorithms we need to write on a sheet of paper.
Ho presentato la mia candidatura tramite l'università. La procedura ha richiesto una settimana. Ho sostenuto un colloquio presso Nagarro (Nuova Delhi) nel mese di set 2022
Colloquio
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
Domande di colloquio [1]
Domanda 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)
Ho presentato la mia candidatura online. Ho sostenuto un colloquio presso Nagarro
Colloquio
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.
Domande di colloquio [1]
Domanda 1
Q:Did you know about sorting ,tell about them.
Q:difference between list and tuple
Ho presentato la mia candidatura tramite l'università. Ho sostenuto un colloquio presso Nagarro nel mese di ago 2021
Colloquio
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.
Domande di colloquio [1]
Domanda 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.
