Nagarro Interview Experience by Sachendra Jain

New update is available. Click here to update.

Software Developer

Nagarro

3 rounds | 5 Coding problems

Anonymous

Fresher | Jun 2021

Selected

438 views

0 comments

4 upvotes

Interview preparation journey

Preparation

Duration: 4 months

Topics: Data Structure, SQL, Database concepts, Aptitude, OOPS

Tip

Tip 1 : For clearing online assessment you should be able to solve average aptitude questions.
Tip 2 : Solving 200-250 easy and medium (60% + acceptance) questions on leetcode would be enough for clearing interview.
Tip 3 : Having a project is a plus point though they do not focus much on project.

Application process

Where: Company Website

Eligibility: No criteria

Resume tip

Tip 1 : Try to add proof of what you are adding. Add projects link, certificates link, coding profiles link etc.
Tip 2 : Content should not be so dense or so sparse.

Interview rounds

Round

Easy

Online Coding Interview

Duration30 minutes

Interview date12 Jun 2021

Problems1

MCQ Questions

There were 25 aptitude questions and 15 questions from DSA, DBMS.

Number Of MCQs - 40

Round

Easy

Video Call

Duration30 minutes

Interview date14 Jun 2021

Problems3

Ninja And Divisible Array

Ninja has been given an array/list ‘ARR’ of even size ‘N’ and an integer ‘K’. Ninja gives his friend a task to divide the given ‘ARR’ into ‘N’/2 pairs such that the sum of each pair should be div...

Problem approach

Step 1: I stored the square in an variable, part1;
Step 2: initiated two variable part2_length = 0 and part2 = 0;
Step 3: run a while loop with condition part1 != 0
last_digit = part1 % 10
part1 = part1/10
part2 = last_digit * pow(10, part2_length) + part2
if(part1 + part2 == n) return true
Step 4 outside loop return false

Try solving now

Isomorphic Strings

You have been given two strings, ‘str1’ and ‘str2’. Your task is to check whether the two given strings are isomorphic to each other.

Note :

Problem approach

Intution: When any ith character occurs for the first time map it to the ith character of another string and then if next time that character occurs, then in another string the character should be equal to the character we mapped it with. size of both strings should be same.
Step1: Created two array of size 256 each say a1, a2.
Step 2: Start traversing the string i = 0 to size of string:<...

Try solving now

OOPS Questions

Explain function overloading and function overriding.
Explain abstract class and abstract functions.

Round

Easy

HR Round

Duration15 minutes

Interview date14 Jun 2021

Problems1

Basic HR Questions

Introduce yourself.

What is your strength and weakness?