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

Associate Engineer

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

Interview preparation journey

expand-icon
Preparation
Duration: 2 months
Topics: OOPS, Data Structures, Algorithms, Networking, Operating Systems
Tip
Tip

Tip 1 : revise interview questions for each topic 
Tip 2 : be prepared to be asked anything from your resume including projects 
Tip 3 : while practising coding, use notepad instead of IDEs

Application process
Where: Campus
Eligibility: No criteria
Resume Tip
Resume tip

Tip 1 : keep it to the point, 1 page resume is enough for a fresher 
Tip 2 : add important links like LinkedIn profile, leetcode profile

Interview rounds

01
Round
Medium
Online Coding Test
Duration60 minutes
Interview date19 Jun 2021
Coding problem2

2 coding questions 
Afternoon test 
Proctored

1. Trailing Zeros in Factorial

Moderate
15m average time
80% success
0/80
Asked in companies
UberGoldman SachsCapegemini Consulting India Private Limited

You are given an integer N, you need to find the number of trailing zeroes in N! (N factorial).

Note:

1. Trailing zeros in a number can be defined as the number of continuous suffix zeros starting from the zeroth place of a number.
2. For example, if a number X = 1009000, then the number of trailing zeros = 3 where the zeroth place is 0, the tenth place is 0, the hundredth place is 0.
3. ! means “FACTORIAL”. Factorial of a number is calculated by the product of the integer and all integers below it till 1.
4. Value of 0! is 1.
Problem approach

For a 0 to be present we need 2 and 5 in the product elements 
Counted number of 2s ans 5s
Minimum of that would be the answer

Try solving now

2. Count Ways To Reach The N-th Stairs

Moderate
30m average time
80% success
0/80
Asked in companies
OYOLinkedInGrab

You have been given a number of stairs. Initially, you are at the 0th stair, and you need to reach the Nth stair.


Each time, you can climb either one step or two steps.


You are supposed to return the number of distinct ways you can climb from the 0th step to the Nth step.

Note:

Note: Since the number of ways can be very large, return the answer modulo 1000000007.
Example :
N=3

Example

We can climb one step at a time i.e. {(0, 1) ,(1, 2),(2,3)} or we can climb the first two-step and then one step i.e. {(0,2),(1, 3)} or we can climb first one step and then two step i.e. {(0,1), (1,3)}.
Problem approach

Knew it would use dp and applied it to solve the question

Try solving now
02
Round
Medium
Video Call
Duration30 mins
Interview date19 Jul 2021
Coding problem1

Afternoon interview 
I was asked OOPS, OS, DBMS, DS and Algo questions. 
Questions around my project 
Questions around my internships

1. Operating System Questions

1. What is Paging?

2. What is Segmentation?

Problem approach

Tip 1 : clarify question if you’re not sure 
 

03
Round
Easy
HR Round
Duration15 mins
Interview date19 Jul 2021
Coding problem1

Just after interview, HR asked general questions like whether I am a team player etc

1. Basic HR question

Where do you see after 5 years?

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 Engineer
2 rounds | 3 problems
Interviewed by Nagarro Software
0 views
0 comments
0 upvotes
company logo
Associate Engineer
2 rounds | 2 problems
Interviewed by Nagarro Software
918 views
0 comments
0 upvotes
company logo
Associate Engineer
3 rounds | 8 problems
Interviewed by Nagarro Software
1044 views
0 comments
0 upvotes
company logo
Associate Engineer
3 rounds | 3 problems
Interviewed by Nagarro Software
898 views
0 comments
0 upvotes