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

Trainee Technology

Nagaaro
upvote
share-icon
3 rounds | 3 Coding problems

Interview preparation journey

expand-icon
Journey
My college and my professors played an essential role in my journey to Nagarro. As, I was in NIT, I was provided with every facility like on campus placement opportunities and on campus internship opportunity.At last, after 3 years of practice, I was selected in Nagarro .
Application story
I got to know about this hiring drive of Nagarro coming to our college by my professor. I was ready with my preparations, so I decided to take part in its hiring drive. The selection process consisted of three rounds : 2 technical and last one was a HR round.
Why selected/rejected for the role?
I think I had the appropriate skills and a good amount of knowledge to prove that I was the right man for the post. I also solved coding questions in the optimal manner.
Preparation
Duration: 2 months
Topics: Aptitude, Data Structures, Algorithm, OOPS, Coding
Tip
Tip

Tip 1 : Practice at least 100 aptitude questions a week 
Tip 2 : Practice coding questions on coding platforms like coding ninjas codestudio, Geeksforgeeks, HackerEarth, etc.
Tip 3 : Prepare for the interview questions

Application process
Where: Campus
Eligibility: Above 6 CGPA
Resume Tip
Resume tip

Tip 1 : The format of your resume should look professional
Tip 2 : Only put those skills in your resume on which you are confident
Tip 3 : Do mention all the projects or internships you have done
Tip 4: Do not put false things on your resume.

Interview rounds

01
Round
Medium
Online Coding Interview
Duration150 minutes
Interview date5 Jan 2021
Coding problem1

It was an Aptitude test and Technical objective test of 60 minutes followed by a Coding test of 90 minutes. The round started at 2:00 PM. Candidates who cleared this round were shortlisted for the next round.

1. Maximum Sum path of a binary tree.

Hard
25m average time
75% success
0/120
Asked in companies
HikeInfosysSamsung

You are given a binary tree having 'n' nodes. Each node of the tree has an integer value.


Your task is to find the maximum possible sum of a simple path between any two nodes (possibly the same) of the given tree.


A simple path is a path between any two nodes of a tree, such that no edge in the path is repeated twice. The sum of a simple path is defined as the summation of all node values in a path.

Try solving now
02
Round
Medium
Video Call
Duration30 minutes
Interview date6 Jan 2021
Coding problem1

This was the technical interview round it started at 12:00 pm, here we were asked to explain the codes we wrote in the coding test and after that, we were given a coding problem for which we needed to write a pseudocode solution and explain it to the interviewer. The interviewer was quite polite and understanding even if we got stuck while writing the code he didn't rush the interview. Candidates who cleared this round were shortlisted for the HR round.

1. Properties of MST in a Undirected Graph

Easy
20m average time
0/10

G = (V,E) is an undirected simple graph in which each edge has a distinct weight, and e is a particular edge of G. Which of the following statements about the minimum spanning trees (MSTs) of G is/are TRUE?

I. If e is the lightest edge of some cycle in G, then every MST of G includes e 
II. If e is the heaviest edge of some cycle in G, then every MST of G excludes e 
Try solving now
03
Round
Medium
HR Round
Duration20 minutes
Interview date6 Jan 2021
Coding problem1

This round started at 4:00 pm, it was also conducted on Microsoft Teams. In this round, we were asked the basic HR questions.
Basically, the interviewer just wanted to test our confidence and communication skills.

1. Jumping Game

Easy
20m average time
80% success
0/40
Asked in companies
Expedia GroupMyntraD.E.Shaw

You are given ‘n’ carrots numbered from 1 to ‘n’. There are k rabbits. Rabbits can jump to carrots only with the multiples of Aj(Aj,2Aj,3Aj…) for all rabbits from 1 to k.

Whenever Rabbit reaches a carrot it eats a little carrot. All rabbits start from the same beginning point. You have to determine the remaining carrots(i.e., carrots which are not eaten by any rabbit) after all rabbits reach the end.

Problem approach

Tip 1: Your answer should be professional
Tip 2 : Mention all your good points in the answer
 

Try solving now

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 create a function in JavaScript?

Choose another skill to practice
Start a Discussion
Similar interview experiences
company logo
Trainee Technology
4 rounds | 9 problems
Interviewed by Nagaaro
1128 views
0 comments
0 upvotes
company logo
Trainee Technology
3 rounds | 5 problems
Interviewed by Nagaaro
841 views
0 comments
0 upvotes
company logo
Trainee Technology
3 rounds | 4 problems
Interviewed by Nagaaro
632 views
0 comments
0 upvotes
company logo
Trainee Technology
3 rounds | 6 problems
Interviewed by Nagaaro
876 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
Trainee Technology
2 rounds | 4 problems
Interviewed by Tata Consultancy Services (TCS)
1186 views
0 comments
0 upvotes
company logo
Trainee Technology
2 rounds | 4 problems
Interviewed by HCL Technologies
4213 views
0 comments
0 upvotes