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

Software Developer

Nagarro Software
upvote
share-icon
4 rounds | 5 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 3 months
Topics: Oops, Data structures, SQL, Dynamic programming, Operating system.
Tip
Tip

Tip 1 : Try to solve at least 10 questions daily
Tip 2 : Practice and consistency is most important 
 

Application process
Where: Campus
Eligibility: 60 percent criteria throughout with no backlogs
Resume Tip
Resume tip

Tip 1 : You should not mention any useless information in it
Tip 2 : Quantify your achievements

Interview rounds

01
Round
Easy
Online Coding Interview
Duration45 minutes
Interview date28 Jul 2022
Coding problem2

1. Puzzle Question

Population of a village increased by 5% from 2007 to 2008 and by 25% from 2005 to 2009. If the population of the village was 480 in 2007, what was its population in 2009?

2. Delete a Node from Linked List

Moderate
40m average time
67% success
0/80
Asked in companies
CIS - Cyber InfrastructureAmazonGroww

You have been given a linked list of integers. Your task is to write a function that deletes a node from a given position, 'POS'.

Note :
Assume that the Indexing for the linked list always starts from 0.

If the position is greater than or equal to the length of the linked list, you should return the same linked list without any change.
Illustration :
The following images depict how the deletion has been performed.

Image-I :

Alt txt

Image-II :

Alt txt

Try solving now
02
Round
Easy
Online Coding Interview
Duration30 minutes
Interview date28 Sep 2022
Coding problem1

1. Minimum Jumps

Moderate
25m average time
75% success
0/80
Asked in companies
DirectiMakeMyTripOYO

Bob lives with his wife in a city named Berland. Bob is a good husband, so he goes out with his wife every Friday to ‘Arcade’ mall.

‘Arcade’ is a very famous mall in Berland. It has a very unique transportation method between shops. Since the shops in the mall are laying in a straight line, you can jump on a very advanced trampoline from the shop i, and land in any shop between (i) to (i + Arr[i]), where Arr[i] is a constant given for each shop.

There are N shops in the mall, numbered from 0 to N-1. Bob's wife starts her shopping journey from shop 0 and ends it in shop N-1. As the mall is very crowded on Fridays, unfortunately, Bob gets lost from his wife. So he wants to know, what is the minimum number of trampoline jumps from shop 0 he has to make in order to reach shop N-1 and see his wife again. If it is impossible to reach the last shop, return -1.

Try solving now
03
Round
Easy
Coding Test - Pen and paper
Duration20 minutes
Interview date5 Aug 2022
Coding problem1

1. Java Questions

Why java is platform independent?

Why java is known as object oriented programming language?

04
Round
Easy
HR Round
Duration20 minutes
Interview date8 Aug 2022
Coding problem1

1. Basic HR Questions

Introduce yourself.

What are your strengths and weaknesses?

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
Software Developer
3 rounds | 7 problems
Interviewed by Nagarro Software
2284 views
0 comments
0 upvotes
company logo
Software Developer
3 rounds | 4 problems
Interviewed by Nagarro Software
1803 views
0 comments
0 upvotes
company logo
Software Developer
3 rounds | 5 problems
Interviewed by Nagarro Software
1437 views
0 comments
0 upvotes
company logo
Software Developer
3 rounds | 9 problems
Interviewed by Nagarro Software
884 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
Software Developer
5 rounds | 14 problems
Interviewed by Microsoft
4029 views
1 comments
0 upvotes
company logo
Software Developer
6 rounds | 12 problems
Interviewed by SAP Labs
2912 views
0 comments
0 upvotes
company logo
Software Developer
3 rounds | 3 problems
Interviewed by Amazon
1270 views
0 comments
0 upvotes