Nagarro Software interview experience Real time questions & tips from candidates to crack your interview

Associate Software Engineer

Nagarro Software
upvote
share-icon
3 rounds | 8 Coding problems

Interview preparation journey

expand-icon
Journey
I was referred by a friend of mine after which within one week i recieved a mail containing a test link a few days prior to the assessment date in july. The assessment consisted of three coding questions of easy medium and hard difficulty level out of which i was able to solve the first two and passed most of the test cases. After three days I recieved a mail that I have qualified the trst and the next day I recieved a mail for My technical interview round. In technical interview the interviewer firstly took a brief introduction then sent me a link of a coding question on hackerrank which was about rotating a array and asked me to solve it within eight minutes that I completed. After that he asked me to explain oops concepts with examples, then some basic questions on my project and DBMS. Later he asked if I had any questions to which I asked about work culture and his experience in nagarro which he explained very politely and the interview was completed. The same day in the evening I recieved a mail that I have been selected in the technical round and my HR interview was scheduled for the next day. In HR interview the HR asked me to give a brief introduction and questions like what is my current location and wether I will be available to join the company in the month of august to which I agreed and the interview was over. In the evening same day I recieved a mail that I have been selected for the position of associate software engineer trainee and Ill be onboarded next month i.e. on 17th of august. After a smooth onboarding and Induction I went for a three month training and was promoted to the position of Associate Software Engineer.
Application story
I was referred by a friend of mine after which within one week i recieved a mail containing a test link a few days prior to the assessment date in july. The assessment consisted of three coding questions of easy medium and hard difficulty level out of which i was able to solve the first two and passed most of the test cases. After three days I recieved a mail that I have qualified the trst and the next day I recieved a mail for My technical interview round. In technical interview the interviewer firstly took a brief introduction then sent me a link of a coding question on hackerrank which was about rotating a array and asked me to solve it within eight minutes that I completed. After that he asked me to explain oops concepts with examples, then some basic questions on my project and DBMS. Later he asked if I had any questions to which I asked about work culture and his experience in nagarro which he explained very politely and the interview was completed. The same day in the evening I recieved a mail that I have been selected in the technical round and my HR interview was scheduled for the next day. In HR interview the HR asked me to give a brief introduction and questions like what is my current location and wether I will be available to join the company in the month of august to which I agreed and the interview was over. In the evening same day I recieved a mail that I have been selected for the position of associate software engineer trainee and Ill be onboarded next month i.e. on 17th of august. After a smooth onboarding and Induction I went for a three month training and was promoted to the position of Associate Software Engineer.
Why selected/rejected for the role?
Working on my communication skills, coding skills and core subjects in my preparation helped me a lot to be able to get selected for this role.
Preparation
Duration: 6 months
Topics: DSA, OOPS, DBMS, Networking, Coding questions
Tip
Tip

Tip 1 : Work on DSA and programming skills
Tip 2 : Be well versed with oops concepts and their application. Don't bluff on your resume and be ready to face any question on whatever you have mentioned there. 
Tip 3 : Use playlists available on youtube on interview questions and practice them. Work om your communication skills and be confident.

Application process
Where: Campus
Eligibility: IT or CS Branch
Resume Tip
Resume tip

Tip 1 : Make an only one page resume and highlight your projects, internships and skills. 
Tip 2 : Don't put false information on your resume.

Interview rounds

01
Round
Medium
Online Coding Test
Duration180 minutes
Interview date15 Jul 2022
Coding problem3

1. Alien Dictionary

Easy
10m average time
70% success
0/40
Asked in companies
Thought WorksNagarro SoftwareTCS

Ninja is learning a new but strange language known as Alien Language. Alien language possesses the same alphabets as of English language, but their order is different. The order of letters are given as ‘ORDER’ string. Ninja has ‘N’ words in the ‘WORDS’ array. Ninja’s task is to check whether the words of ‘WORDS’ are sorted lexicographically in this alien language or not.

Note: ‘ORDER’ consists of all 26 letters of English alphabet.

For Example
If ‘WORDS’ = ["word","world","row"], ‘ORDER’ = "worldabcefghijkmnpqstuvxyz",the answer will be ‘NO’ as first and second words are not lexicographically sorted as ‘l’ comes before ‘d’ in alien language.
Problem approach

We one by one calculate the LCP of each of the given string with the LCP so far. The final result will be our longest common prefix of all the strings.
Note that it is possible that the given strings have no common prefix. This happens when the first character of all the strings are not same.

2nd approach:- The approach is to sort the array of strings and compare the first and last elements of the sorted array. The common prefix between these two elements will be the longest common prefix for the entire array

Try solving now

2. Transform The Matrix

Easy
10m average time
90% success
0/40
Asked in companies
OLX GroupChegg Inc.Barclays

You are given an N * N binary matrix 'MAT'. You can do two operations in the matrix:

i) Swap any two rows.
ii) Swap any two columns. 

Your task is to find the minimum number of operations needed to convert this matrix into a chessboard matrix.

If the task is impossible print -1.

Note:

A chessboard matrix is a binary matrix where there are no two 0’s and no two 1’s who are adjacent to each other.

For example:

[ [1, 0], [0, 1] ] and [ [0, 1], [1, 0] ]  are chessboard matrix whereas [ [1,0], [1, 1] ] isn’t.
Try solving now

3. MegaPrime Numbers

Easy
15m average time
90% success
0/40
Asked in companies
Daffodil SoftwareUnthinkable SolutionsNagarro Software

Given two integers ‘Left’ and ‘Right’. Your task is to find the total count of ‘megaprime’ numbers from the range ‘Left’ to ‘Right’. A ‘megaprime’ number is a prime number and its individual digits are also prime.

For example, ‘53’ is a ‘megaprime’ number because ‘53’ is a prime number and its individual digits,‘3’ and ‘5’, are also prime. ‘13’ is not a ‘megaprime’ number because out of its individual digits (1, 3), ‘1’ is not prime.

Note :

1.’Left’ and ‘Right’ both are inclusive in the range ‘Left’ to ‘Right’.

Example :

‘Left’ = ‘23’  and ‘Right’ = ‘37’

binary_heap

All prime numbers from ‘23’ to ‘37’ are 23, 29, 31, 37

23 is ‘megaprime’ number because ‘2’ and ‘3’ both are prime
29 is not ‘megaprime’ number because ‘9’ is not a prime
31 is not a ‘megaprime’ number because ‘1’ is not a prime number
37 is ‘megaprime’ number because ‘3’ and ‘7’ both are prime numbers
Hence there are two ‘megaprime’ numbers 23, 37 out of 23, 29, 31, 37.
Try solving now
02
Round
Medium
Video Call
Duration30 minutes
Interview date20 Jul 2022
Coding problem4

It happened in morning. 
One coding problem on hackerrank. 
Basic questions on oops and DBMS
Project description.

1. Rotate array

Easy
25m average time
80% success
0/40
Asked in companies
Deutsche BankIBMSalesforce

Given an array 'arr' with 'n' elements, the task is to rotate the array to the left by 'k' steps, where 'k' is non-negative.


Example:
'arr '= [1,2,3,4,5]
'k' = 1  rotated array = [2,3,4,5,1]
'k' = 2  rotated array = [3,4,5,1,2]
'k' = 3  rotated array = [4,5,1,2,3] and so on.
Problem approach

Approach:

We will first take mod of K by N (K = K % N) because after every N rotation array will become the same as the initial array. 

Now, we will iterate the array from i = 0 to i = N-1 and check, 
If i < K, Print rightmost Kth element (a[N + i -K]). Otherwise, 

Print array after ‘K’ elements (a[i – K]).

Try solving now

2. DBMS Question

What is normalization?

3. OOPS Question

What are 4 pillars of OOPS?

4. DBMS Question

What are different types of keys in SQL?

03
Round
Easy
HR Round
Duration10 minutes
Interview date20 Jul 2022
Coding problem1

It happened in the evening

1. Basic HR Questions

What is your current location?

Will you be available to join the company on specified date?

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
company logo
Associate Software Engineer
3 rounds | 3 problems
Interviewed by Nagarro Software
1694 views
0 comments
0 upvotes
company logo
Associate Software Engineer
3 rounds | 4 problems
Interviewed by Nagarro Software
937 views
0 comments
0 upvotes
company logo
Associate Software Engineer
4 rounds | 5 problems
Interviewed by Nagarro Software
941 views
0 comments
0 upvotes
company logo
Associate Software Engineer
3 rounds | 4 problems
Interviewed by Nagarro Software
838 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
Associate Software Engineer
3 rounds | 10 problems
Interviewed by Amdocs
2410 views
0 comments
0 upvotes
company logo
Associate Software Engineer
3 rounds | 2 problems
Interviewed by Ernst & Young (EY)
2775 views
0 comments
0 upvotes
company logo
Associate Software Engineer
3 rounds | 15 problems
Interviewed by Ernst & Young (EY)
2405 views
0 comments
0 upvotes