Nagarro Software interview experience Real time questions & tips from candidates to crack your interview
Software Developer
Nagarro Software
4 rounds | 2 Coding
problems
Selected Interview preparation journey
Preparation
Duration: 2
Topics: Data Structures, Algorithms, OOPs, DBMS, Python, Aptitude
Tip 1 : Make a decent resume that looks perfect and showcase your skills and projects
Tip 2 : Study basic topics in depth as they sometime ask really really basic questions like how the browser works
Tip 3 : Understand real world examples of data structures and OOPs
Application process
Where: Campus
Eligibility: No backlogs
Tip 1 : Don't lie on your resume
Tip 2 : Put your previous internships and projects in detail, Add hyperlinks for projects.
Interview rounds
01
Round
Easy
Online Coding Interview
Duration50 Minutes
Interview date12 Oct 2021
Coding problem0
It was an MCQ round where we had to do 40 questions in 50 minutes. Out of which 25 questions were from data structures and algorithms and 15 questions were of aptitude. Aptitude questions were quite easy but tricky. DSA questions were common questions like "What is the worst case time complexity of inserting a node in BST?". Test was taken on an online platform mettl, environment was quite good and responsive.
02
Round
Medium
Online Coding Test
Duration150 Minutes
Interview date15 Oct 2021
Coding problem1
After getting results of MCQ round there was a coding round which had some coding questions to be completed in 150 minutes. Questions were divided in two sections. There were two questions for commando software developer role and three questions for Software developer role. I was able to solve all three question from SD section and solved one question with half of the test cases passed in CSD section. Most of the questions were from the topics like binary trees, backtracking greedy algorithms and dynamic programming.
1. Maximum Sum Path Of A Binary Tree.
Hard
25m average time
75% success
0/120
Asked in companies
You are given a binary tree having 'n' nodes. Each node of the tree has an integer value.
Your task is to find the maximum possible sum of a simple path between any two nodes (possibly the same) of the given tree.
A simple path is a path between any two nodes of a tree, such that no edge in the path is repeated twice. The sum of a simple path is defined as the summation of all node values in a path.
03
Round
Easy
Face to Face
Duration20 Minutes
Interview date26 Oct 2021
Coding problem1
This was a technical round. First question was my introduction and then interviewer gone through my resume and asked questions related to my projects like what technologies you used and how did you design the database for this particular project. He asked some basic and medium level question from python as I told him that python was my primary language. And then he asked some questions from data structures and OOPs.
Questions asked: 1. What is difference between a list and tuple?
2. How the ordered dictionary is implemented in python?
3. What data structure is used in music player to change music?
4. What is the perfect data structure for facebook comment section?
5. How will you sort a binary array (array which contains only zeros and ones)?
1. Sort Array of 0s and 1s.
Easy
10m average time
90% success
0/40
Asked in companies
You are given an array ‘A’ of size ‘N’ containing only 0s and 1s. You have to sort the array by traversing the array only once.
For Example:
For the following array:
[0 1 1 1 0 0 1]
The output should be [0 0 0 1 1 1 1].
Note:
You have to sort the array in place.
Problem approach
At first I gave him a brute force approach of using bubble sort and then Interviewer asked me to optimized the solution then I gave him an optimize solution. In optimal approach I traversed the array and counted the number of ones and zeroes in the array and then in next traversal I have filled the array with ones first and then filled rest of the array with zeroes. Then again interviewer asked me if I can do the same without counting numbers of ones and zeroes so at the end I came up with one more optimized solution in which I was able to sort that array in single traversal and without counting the ones and zeroes. It is a common coding question and is available on different coding platforms like interviewbit, leetcode and coding studio.
04
Round
Easy
HR Round
Duration10 minutes
Interview date2 Nov 2021
Coding problem0
It was quite easy. Interviewer first gave me his introduction and then asked me about myself. He asked about my previous internships and projects mentioned in the resume. No technical question was asked in this round.
Questions asked: Do you have any other offer in hand?
What do you know about Nagarro?
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
How do you remove whitespace from the start of a string?
Choose another skill to practice
Similar interview experiences
Software Developer
3 rounds | 4 problems
Interviewed by Nagarro Software
Rejected
1803 views
0 comments
0 upvotes
Software Developer
4 rounds | 5 problems
Interviewed by Nagarro Software
Selected 1210 views
0 comments
0 upvotes
Software Developer
3 rounds | 5 problems
Interviewed by Nagarro Software
Selected 1438 views
0 comments
0 upvotes
Software Developer
3 rounds | 9 problems
Interviewed by Nagarro Software
Selected 885 views
0 comments
0 upvotes
Companies with similar interview experiences
Software Developer
5 rounds | 14 problems
Interviewed by Microsoft
Selected 4029 views
1 comments
0 upvotes
Software Developer
6 rounds | 12 problems
Interviewed by SAP Labs
Selected 2912 views
0 comments
0 upvotes
Software Developer
3 rounds | 3 problems
Interviewed by Amazon
Selected 1271 views
0 comments
0 upvotes