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

SDE - 1

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

Interview preparation journey

expand-icon
Preparation
Duration: 3 months
Topics: Data Structures, Html, CSS, Javascript, OS, DBMS, OOPS
Tip
Tip

Tip 1 : Practice at least 20 questions from each topic.
Tip 2 : Must have complete Idea of project Written on Resume.

Application process
Where: Company Website
Eligibility: No criteria
Resume Tip
Resume tip

Tip 1 : Write technologies and projects which you are comfortable with.
Tip 2 : Keep it minimalistic.

Interview rounds

01
Round
Easy
Online Coding Interview
Duration150 minutes
Interview date7 May 2021
Coding problem3

10 am to 12:30 pm
Online proctoring

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

simple loop for i to divide by n/5^i and count till n/5^i becomes zero.

Try solving now

2. Count derangements

Moderate
35m average time
60% success
0/80
Asked in companies
AmazonInfo Edge India (Naukri.com)OLX Group

A Derangement is a permutation of ‘N’ elements, such that no element appears in its original position. For example, an instance of derangement of {0, 1, 2, 3} is {2, 3, 1, 0}, because 2 present at index 0 is not at its initial position which is 2 and similarly for other elements of the sequence.

Given a number ‘N’, find the total number of derangements possible of a set of 'N’ elements.

Note:
The answer could be very large, output answer %(10 ^ 9 + 7).
Problem approach

First applied recursion using reccurance relative (n-1) * ( count(n-1) + count(n-2) ), Optimised further using Dp. Recursion solution was also getting accepted.

Try solving now

3. Minimum Window Subsequence

Hard
27m average time
0/120
Asked in companies
AmazonNagarro SoftwareTummee

You are given two strings ‘S’ and ‘T’. Your task is to find the minimum (Contiguous) substring ‘W’ of ‘S’, such that ‘T’ is a subsequence of ‘W’

A subsequence is a sequence that can be derived from another sequence by removing zero or more elements, without changing the order.

A substring is a contiguous part of a string.

For example:
For the given string “CodingNinjas”: “Ninja” is a substring while “dinas” is a subsequence. 

If there is no such Window in ‘S’ that covers all characters in ‘T’, return an empty string "". If there are multiple such minimum length windows, return the one with the smallest starting index.

Problem approach

Applied sliding window and using Hashmap to count unique characters.

Try solving now
02
Round
Easy
Video Call
Duration30 minutes
Interview date21 May 2021
Coding problem3

It was in afternoon 2pm.
platform was skype.

1. DBMS Question

Write SQL query to fetch common data from two table.

2. Trapping Rain Water

Moderate
15m average time
80% success
0/80
Asked in companies
HCL TechnologiesCiti BankAtlassian

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.



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:

Alt Text

Note :
You don't need to print anything. It has already been taken care of. Just implement the given function.
Problem approach

Used two prefix sum arrays and for each block calculate water on each block.

Try solving now

3. Explain difference between DFS and BFS.

Problem approach

Gave example and traversal of BFS and DFS

03
Round
Easy
HR Round
Duration15 minutes
Interview date25 May 2021
Coding problem2

10 am 
Video call

1. Basic HR question

Why you want to join our company?

2. Basic HR Question

Where You see Yourself in 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
SDE - 1
3 rounds | 3 problems
Interviewed by Nagarro Software
0 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by Nagarro Software
937 views
0 comments
0 upvotes
company logo
SDE - 1
2 rounds | 4 problems
Interviewed by Nagarro Software
1222 views
0 comments
0 upvotes
company logo
SDE - 1
2 rounds | 4 problems
Interviewed by Nagarro Software
759 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
115097 views
24 comments
0 upvotes
company logo
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
58238 views
5 comments
0 upvotes
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
35147 views
7 comments
0 upvotes