Nagarro Software interview experience Real time questions & tips from candidates to crack your interview
SDE - 1
Nagarro Software
3 rounds | 10 Coding
problems
Selected Interview preparation journey
Preparation
Duration: 3 months
Topics: Data Structures,OOPS,Algorithms,DBMS,SQL,Aptitude
Tip 1 : Practice alteast 100 DSA Questions.
Tip 2 : Atleast 2 projects of Beginner to Moderate Level.
Tip 3 : Don't Panic just Give your Best Shot.
Application process
Where: Company Website
Eligibility: 7+ CGPA
Tip 1: Add Atleast 2 projects.
Tip 2: Mention each Tech with expertise level.
Interview rounds
01
Round
Medium
Online Coding Interview
Duration60+150 mins
Interview date24 Jan 2022
Coding problem2
Timing of This Round was from 02:00-04:00 PM.
Consists of MCQ Questions- 60 Minutes and Coding Questions - 150 Minutes
1. Count Frequency
Easy
15m average time
85% success
0/40
Asked in companies
You are given a string 'S' of length 'N', you need to find the frequency of each of the characters from ‘a’ to ‘z’ in the given string.
Example :
Given 'S' : abcdg
Then output will be : 1 1 1 1 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
Problem approach
A Simple Solution is to create a count array of size n as the elements are in range from 1 to n. This solution works in O(n) time, but requires O(n) extra space.
2. String Palindrome
Easy
0/40
Asked in companies
Given a string, determine if it is a palindrome, considering only alphanumeric characters.
Palindrome
A palindrome is a word, number, phrase, or other sequences of characters which read the same backwards and forwards.
Example:
If the input string happens to be, "malayalam" then as we see that this word can be read the same as forward and backwards, it is said to be a valid palindrome.
The expected output for this example will print, 'true'.
From that being said, you are required to return a boolean value from the function that has been asked to implement.
02
Round
Medium
Video Call
Duration60 mins
Interview date31 Jan 2022
Coding problem3
It was at 3:00 PM in afternoon , i was well prepared for this round.. that's why didn't faced any difficulty..
1. DBMS Questions
1.What is Transaction and its lifecycle?
2.ACID Properties.
3.Normalisation and Types of Normal forms.
2. Sort 0 1 2
Easy
22m average time
0/40
Asked in companies
You have been given an integer array/list(ARR) of size 'N'. It only contains 0s, 1s and 2s. Write a solution to sort this array/list.
Note :
Try to solve the problem in 'Single Scan'. ' Single Scan' refers to iterating over the array/list just once or to put it in other words, you will be visiting each element in the array/list just once.
Problem approach
These are the folowing steps:
Maintain 3 variables low, high and mid
low - all elements before low are 0
mid - all elements between low and mid are 1
high - all elements after high are 2
Initially low, mid are set at 0 and high is at n-1
Now, we iterate mid from 0 to high, and for every element
if it is equal to 0, we swap it with element at low, and increement low and mid
else if it is equal to 2, we swap it with element at high, and decreement high
else we just increement mid (i.e element is equla to 1)
This method ensures partition, as low and high maintain elements according to their values, and then change their positions, ensuring all elements before low are lower than low_value and all elements after high are higher than high_value
3. Trapping Rain Water
Moderate
15m average time
80% success
0/80
Asked in companies
You have been given a long type array/list 'arr’ of size 'n’.
It represents an elevation map wherein 'arr[i]’ denotes the elevation of the 'ith' bar.
Print the total amount of rainwater that can be trapped in these elevations.
Note :
The width of each bar is the same and is equal to 1.
Example:
Input: ‘n’ = 6, ‘arr’ = [3, 0, 0, 2, 0, 4].
Output: 10
Explanation: Refer to the image for better comprehension:
Note :
You don't need to print anything. It has already been taken care of. Just implement the given function.
Problem approach
The idea is to:
Traverse every array element and find the highest bars on the left and right sides. Take the smaller of two heights. The difference between the smaller height and the height of the current element is the amount of water that can be stored in this array element.
Follow the steps mentioned below to implement the idea:
Traverse the array from start to end:
For every element:
Traverse the array from start to that index and find the maximum height (a) and
Traverse the array from the current index to the end, and find the maximum height (b).
The amount of water that will be stored in this column is min(a,b) - array[i], add this value to the total amount of water stored
Print the total amount of water stored.
Below is the implementation of the above approach.
03
Round
Easy
HR Round
Duration30 mins
Interview date11 Feb 2022
Coding problem5
It was at 3:00 Pm , HR called me the same day and told me i was selected for the HR Round.
1. Basic HR Question
Tell me about Yourself.
Problem approach
Tip 1: Just Introduce Yourself
2. Basic HR Question
What are your strengths and weaknesses?
Problem approach
Tip 1:Tell them about your strength and weaknesses
3. Basic HR Question
Why Nagarro?
Problem approach
Tip 1:Reason behind joining nagarro
4. Basic HR Question
Tell me about your family background.
Problem approach
Tip 1:Tell them about your Family Background
5. Basic HR Question
Are you ready to join immediately?
Problem approach
Tip 1: Just share your availability
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
SDE - 1
3 rounds | 3 problems
Interviewed by Nagarro Software
Selected 
0 views
0 comments
0 upvotes
SDE - 1
3 rounds | 7 problems
Interviewed by Nagarro Software
Selected 936 views
0 comments
0 upvotes
SDE - 1
2 rounds | 4 problems
Interviewed by Nagarro Software
Rejected
1221 views
0 comments
0 upvotes
SDE - 1
2 rounds | 4 problems
Interviewed by Nagarro Software
Selected 758 views
0 comments
0 upvotes
Companies with similar interview experiences
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
Selected 115097 views
24 comments
0 upvotes
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
Selected 58237 views
5 comments
0 upvotes
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
Selected 35147 views
7 comments
0 upvotes