I applied for Nagarro for Software Developer profile through college.
Round 1: Online MCQ
Around 100 students appeared for the test across B.Tech CSE/IT/ECE and MCA. The test was conducted on Mettle platform. It consisted of 2 sections, Technical MCQs which were based on complexities, data structures, etc and Aptitude MCQs. There was +4, -1 marking scheme for each question.
Round 2: Pen & Paper Coding Round
21 students were selected for this round and invited to the Gurgaon Office. 3 questions were given to be completed in 75 minutes. The questions were:
For this I gave the recursive solution. Complexity was 2^n.
2. Given a string, find out the words that have length even and greater than equal to 4 (e.g. 4, 6, 8, …) and split such words from the middle and output the string.
e.g. Given String : “Hello I am Mike Saunders”
Output: “Hello I am Mi ke Saun ders”
I checked the condition while traversing the given string and accordingly allocated the characters to a new result string. And finally output the result string.
The question is a modified version of this question:
I had earlier done the combination sum question so I modified it to bring out the right solution for the modified version. I used backtracking for this solution.
Round 3: Technical Interview
9 students were shortlisted for this round. Every candidate was asked to explain their written codes and come up with a better complexity version. For the first question, I had an idea that it could be solved using Dynamic Programming. So, I first explained the recursive solution and then started with the optimised approach. He made me write the code for this question but was more interested in the approach and how clear was I with the logic. He questioned me about bottom-up and top down approach. Why did you think it could be solved using dynamic programming.
He pointed out a minimal error in the second code and moved ahead to the third code. He made my dry run the whole question step by step while referring to each line of my code. He seemed satisfied with my solution.
Then he asked me about my projects, my areas of interest and some DBMS concepts. And few basic questions on data structures:
Find the middle element of the linked list.
Function to get the minimum element of the stack at any point of time in O(1).
Round 4: HR Interview
Only I was shortlisted for this round. I was asked to fill the employment detail form and a questionnaire having personality based questions. The interview started with tell me about yourself. Other questions were:
Are you on any online coding platforms? Any achievement as of now?
How many rejections and why?
Describe events when you showcased leadership and organizing skills.
It was a 10-15 minutes interview and I was selected after this round.
- Nagarro Interview Experience for Xamarin Developer | 3 Years Experience
- Nagarro Interview Experience | Set 1 (On-Campus)
- Nagarro Interview Experience | Set 2
- Nagarro Interview Experience | Set 3 (On-Campus)
- Nagarro Interview Experience | Set 4 (Off-Campus)
- Nagarro Interview Experience | Set 5 (Pool Campus Drive)
- Nagarro Interview Experience | Set 6 (On-Campus)
- Nagarro Interview Experience | Set 7 (For 2 Years Experienced)
- Nagarro Interview Experience | Set 8 (On-Campus)
- Nagarro Interview Experience | Set 9
- Nagarro Interview Experience | Set 10 (Software Developer Fresher)
- Nagarro On-Campus Interview Experience
- Nagarro Interview Experience Off Campus for Trainee Technology
- Nagarro Interview Experience Off-campus
- Nagarro Interview Experience 2019| Pool Campus (Trainee, Technology)
- Nagarro Interview Experience for 1.5 year Software Developer
- Nagarro(Gurgaon) Interview Experience for 2020 batch
- Nagarro Interview Experience | Off-Campus
- Nagarro Interview Experience of Trainee Technology for 2020 batch
- Nagarro Interview Experience(On-Campus)
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.