Nagarro Software interview experience Real time questions & tips from candidates to crack your interview
SDE - 1
Nagarro Software
3 rounds | 4 Coding
problems
Rejected
Interview preparation journey
Preparation
Duration: 2 months
Topics: Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming
Tip 1 : Practice standard DSA problems from Leetcode.
Tip 2 : Prepare SQL
Application process
Where: Campus
Eligibility: 7 above
Tip 1 : Should be updated with all projects and skills
Tip 2 : Should be easy to read
Interview rounds
01
Round
Medium
Online Coding Interview
Duration90 Minutes
Interview date14 Nov 2019
Coding problem2
Asked questions from Aptitude and Coding questions
1. Letter Combinations of a Phone Number
Moderate
35m average time
65% success
0/80
Asked in companies
Given a string S containing digits from 2 to 9 inclusive. Your task is to find all possible letter combinations that the number could represent.
A mapping from Digits to Letters (just like in Nokia 1100) is shown below. Note that 1 does not map to any letter.
Problem approach
A recursive solution is intuitive and common. We keep adding each possible letter recursively and this will generate all the possible strings.
2. Count Inversions
Moderate
40m average time
55% success
0/80
Asked in companies
For a given integer array/list 'ARR' of size 'N' containing all distinct values, find the total number of 'Inversions' that may exist.
An inversion is defined for a pair of integers in the array/list when the following two conditions are met.
A pair ('ARR[i]', 'ARR[j]') is said to be an inversion when:
1. 'ARR[i] > 'ARR[j]'
2. 'i' < 'j'
Where 'i' and 'j' denote the indices ranging from [0, 'N').
Problem approach
Suppose the number of inversions in the left half and right half of the array (let be inv1 and inv2); what kinds of inversions are not accounted for in Inv1 + Inv2? The answer is – the inversions that need to be counted during the merge step. Therefore, to get the total number of inversions that needs to be added are the number of inversions in the left subarray, right subarray, and merge().
02
Round
Easy
Face to Face
Duration60 Minutes
Interview date30 Nov 2019
Coding problem1
Questions on Data Structures and Algorithms
1. Rod cutting problem
Moderate
40m average time
75% success
0/80
Asked in companies
Given a rod of length ‘N’ units. The rod can be cut into different sizes and each size has a cost associated with it. Determine the maximum cost obtained by cutting the rod and selling its pieces.
Note:
1. The sizes will range from 1 to ‘N’ and will be integers.
2. The sum of the pieces cut should be equal to ‘N’.
3. Consider 1-based indexing.
Problem approach
A naive solution to this problem is to generate all configurations of different pieces and find the highest-priced configuration. This solution is exponential in terms of time complexity.
Therefore rejected.
Optimised approach:We can get the best price by making a cut at different positions and comparing the values obtained after a cut. We can recursively call the same function for a piece obtained after a cut.
Let cutRod(n) be the required (best possible price) value for a rod of length n. cutRod(n) can be written as follows.
cutRod(n) = max(price[i] + cutRod(n-i-1)) for all i in {0, 1 .. n-1}
03
Round
Easy
HR Round
Duration20 Minutes
Interview date30 Nov 2019
Coding problem1
Discussed the coding problem I solved in the If previous round. How I build my solution and is there any way to optimize?
Questions on the projects in my resume were asked and normal HR like questions
1. Basic HR Questions
- If you are asked to work again on your project, What is the thing that you are going to modify?
- Explain the working of your project.
- Why should we hire you?
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 937 views
0 comments
0 upvotes
SDE - 1
2 rounds | 4 problems
Interviewed by Nagarro Software
Rejected
1222 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 58238 views
5 comments
0 upvotes
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
Selected 35147 views
7 comments
0 upvotes