Nagarro Technical Trainee Interview Questions, Process, and Tips

Round duration - 150 minutes
Round difficulty - Medium

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.

Q1. 
Maximum Sum Path in a Binary Tree
Your task is to determine the maximum possible sum of a simple path between any two nodes (possibly the same) in a given binary tree of 'N' nodes with integer values.
Ex...read more
Ans. Recursive Solution
First of all, we need to observe that for any simple path in a Binary tree, there is one and only one node at the maximum height. So, the idea is to fix each node as the highest node in a path and then find the maximum sum path having the current node as the highest node. The final answer will be the maximum value among all the path sum values for each node. To find the maximum sum path for a particul...read more
Answered Anonymously
Add your answer

Round duration - 30 minutes
Round difficulty - Medium

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.

Q1. 
Properties of MST in an Undirected Graph
You have a simple undirected graph G = (V, E) where each edge has a distinct weight. Consider an edge e as part of this graph. Determine which of the given stateme...read more
Add your answer

Round duration - 20 minutes
Round difficulty - Medium

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.

Q1. 
Jumping Game Problem Statement
In this problem, you have ‘n’ carrots lined up and denoted by numbers 1 through ‘n’. There are ‘k’ rabbits, and each rabbit can jump to carrots that are multiples of its uni...read more
Ans. 
Tip 1: Your answer should be professional
Tip 2 : Mention all your good points in the answer
 
Answered Anonymously
Add your answer

Round duration - 30 minutes
Round difficulty - Medium

This round consists of technical interview.
The interviewer ask questions related to the 3 coding problems given in previous round i.e.de-bug the code and explain the time and space complexity.
In last they give one problem of nearest square integer and want the optimized solution only.
The students selected in this round are shortlisted for next round.

Q1. 
Find The Closest Perfect Square Problem Statement
You are given a positive integer N. Your task is to find the perfect square number that is closest to N and determine the number of steps required to reac...read more
Add your answer

Round duration - 90 minutes
Round difficulty - Easy

Timing: Morning (10 AM)
Environment: Online (Proctored)
Coding Round (3 Questions)

Q1. 
Nth Prime Number Problem Statement
Find the Nth prime number given a number N.
Explanation:
A prime number is greater than 1 and is not the product of two smaller natural numbers. A prime number has exa...read more
Ans. 
Step 1  I opted for the Sieve of Eratosthenes approach.
Step 2  Store all prime numbers in a vector and return (n-1)th for Nth Prime Number.
Answered Anonymously
Add your answer
Q2. 
Character Formation Check
Determine if the second string STR2 can be constructed using characters from the first string STR1. Both strings may include any characters.
Input:
The first line contains an i...read more
Ans. 
Step 1  The idea was to count frequencies of string 1 and deduct from frequencies of string 2 simultaneously.
Step 2  If frequency at any stage becomes negative, false should be returned.
Answered Anonymously
Add your answer
Q3. 
Counting Derangements Problem
A derangement is a permutation of 'N' elements, where no element appears in its original position. For instance, a derangement of {0, 1, 2, 3} is {2, 3, 1, 0} because each el...read more
Ans. 
Step 1  I followed the recursive approach initially, even though it passed all the cases.
Step 2  I still had time so changed it to DP, which reduced my time.
Answered Anonymously
Add your answer

Round duration - 40 minutes
Round difficulty - Medium

Timing: 10:00 AM
Environment: Online (Webcam + Mic on)
The interviewer was friendly and to the point.

Q1. 
Detect and Remove Loop in Linked List
For a given singly linked list, identify if a loop exists and remove it, adjusting the linked list in place. Return the modified linked list.
Expected Complexity:
A...read more
Ans. 
Step 1: I went for the Hashing technique, which was more of a brute force approach.
Step 2: So, I went for a more optimized approach of Floyd’s Cycle-Finding Algorithm, which is 0(n) in Time and 0(1) in space. The interviewer was satisfied.
Answered Anonymously
Add your answer
Q2. 
Spiral Order Traversal of a Binary Tree
Given a binary tree with N nodes, your task is to output the Spiral Order traversal of the binary tree.
Input:
The input consists of a single line containing elem...read more
Ans. Level Order Traversal
We can use level order traversal (recursive) to explore all levels of the tree. Also, at each level nodes should be printed in alternating order. 
 
For example - The first level of the tree should be printed in left to the right manner, the Second level of the tree should be printed in right to the left manner, Third again in left to right order and so on
 
So, we will use a Direction v...read more
Answered Anonymously
Add your answer
Q3. 
Trapping Rainwater Problem Statement
You are given an array ARR of long type, which represents an elevation map where ARR[i] denotes the elevation of the ith bar. Calculate the total amount of rainwater t...read more
Ans. 
Step 1  I preferred initially to traverse each array element and find the highest bars.
Step 2  To improve on the previous solution, instead of array traversal, I pre-computed the heights of the highest bars on left and right.
Answered Anonymously
Add your answer

Round duration - 20 minutes
Round difficulty - Easy

Timing (In Evening)
Environment (Same as Technical Interview)

Round duration - 90 minutes
Round difficulty - Medium

Timing Morning 
Environment Online
3 Coding Questions were asked

Q1. 
Count Ways to Reach the N-th Stair Problem Statement
You are provided with a number of stairs, and initially, you are located at the 0th stair. You need to reach the Nth stair, and you can climb one or tw...read more
Add your answer
Q2. 
Nth Prime Number Problem Statement
Find the Nth prime number given a number N.
Explanation:
A prime number is greater than 1 and is not the product of two smaller natural numbers. A prime number has exa...read more
Add your answer
Q3. 
String Compression Problem Statement
Ninja needs to perform basic string compression. For any character that repeats consecutively more than once, replace the repeated sequence with the character followed...read more
Add your answer

Round duration - 40 minutes
Round difficulty - Medium

Timing Morning
Environment Online
Interviewer was very supportive during the Interview

Q1. 
Find All Pairs Adding Up to Target
Given an array of integers ARR of length N and an integer Target, your task is to return all pairs of elements such that they add up to the Target.
Input:
The first line ...read more
Add your answer
Q2. 
Trapping Rain Water Problem Statement
You are given a long type array/list ARR of size N, representing an elevation map. The value ARR[i] denotes the elevation of the ith bar. Your task is to determine th...read more
Add your answer
Q3. 
Spiral Order Traversal of a Binary Tree
Given a binary tree with N nodes, your task is to output the Spiral Order traversal of the binary tree.
Input:
The input consists of a single line containing elem...read more
Add your answer

Round duration - 20 minutes
Round difficulty - Easy

Timing Morning
Environment Online
Interviewer was friendly