Nagarro Technical Trainee Interview Questions, Process, and Tips for Freshers

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 of a binary tree.
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 a...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 by CodingNinjas
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 a Undirected Graph
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 minimu...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
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 rea...read more
Ans. 
Tip 1: Your answer should be professional
Tip 2 : Mention all your good points in the answer
 
Answered by CodingNinjas
View 2 more amswers

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
You are given a positive integer ‘N’. You are required to print the perfect square number closest to the ‘N’ and the number of steps required to reach that number.
For Exam...read more
Ans. Naive Approach
We will move in both directions, positive and negative, of ‘N’, and check if we get any perfect square.
Algorithm:
1. Initiate a variable i = 0 .
2. Iterate from
   1. Start a loop and keep adding and subtracting ‘i’ in ‘N’ and check for a perfect square.
   2. To check for a perfect square, you can use a for loop starting from (say) ‘j’ = 1 and less than that number (X) and check if( j * j == X). if equal, return true and brea...read more
Answered by CodingNinjas
View 1 more amswer

Round duration - 90 minutes
Round difficulty - Easy

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

Q1. Find Nth Prime
You are given a number 'N'. Your task is to find Nth prime number.
A prime number is a number greater than 1 that is not a product of two smaller natural numbers. Prime numbers hav...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 by CodingNinjas
View 4 more amswers
Q2. Check whether second string can be formed from characters of first string
You are given two strings STR1 and STR2. You need to check whether STR2 can be formed from the characters of STR1. Both the string...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 by CodingNinjas
View 1 more amswer
Q3.  Count derangements
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 ...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 by CodingNinjas
View 3 more amswers

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
Given a singly linked list, you have to detect the loop and remove the loop from the linked list, if present. You have to make changes in the given linked list itself and return the ...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 by CodingNinjas
View 3 more amswers
Q2. Spiral Order Traversal of a Binary Tree
You have been given a binary tree of 'N' nodes. Print the Spiral Order traversal of this binary tree.
For example
For the given binary tree [1, 2, 3, -1, -...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 by CodingNinjas
View 1 more amswer
Q3. Trapping Rainwater
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. Prin...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 by CodingNinjas
View 3 more amswers

Round duration - 20 minutes
Round difficulty - Easy

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

Q1. What are your Strengths and Weakness?
Ans. 
Tip 1: Be confident
Tip 2: Look at them with a straight back
Tip 3: Be honest and highlight your strengths.
Answered by CodingNinjas
Add your answer
Q2. Where do you see yourself in 5 years?
Ans. 
Tip 1 : Don't say things like the CEO of the company or where you're sitting.
Tip 2 : Try to read different answers and be confident.
Answered by CodingNinjas
Add your answer
Q3. Questions about the company.
Ans. 
Tip 1 : Before any interview have knowledge of what the company does.
Tip 2 : How it has performed over the years, what are its focus in business?
Answered by CodingNinjas
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

Timing Morning 
Environment Online
3 Coding Questions were asked

Q1. Count Ways To Reach The N-th Stairs
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 either climb one step or two steps. Y...read more
Ans. Brute Force
One basic approach is to explore all possible steps which can be climbed with either taking one step or two steps. So at every step, we have two options to climb the stairs either we can climb with one step, or we can climb with two steps. So the number of ways  can be recursively defined as :
countDistinctWayToClimbStair ( currStep, N ) = countDistinctWayToClimbStair ( currStep+1, N ) + countDistinctWay...read more
Answered by CodingNinjas
View 3 more amswers
Q2. Find Nth Prime
You are given a number 'N'. Your task is to find Nth prime number.
A prime number is a number greater than 1 that is not a product of two smaller natural numbers. Prime numbers hav...read more
Ans. Brute Force
Consider a function FINDPRIME that takes number N as input parameter and do:
1. Initialize NUM to 1 and COUNT to 0.
2. Iterate for COUNT, while COUNT<=N:
   1. Increment NUM by 1
   2. Iterate for each 2<= i <= NUM and check:
      1. If NUM % i == 0, break the loop.
   3. Check if i == NUM, it is a prime number. Do:
      1. Increment COUNT by 1.
3. Print NUM.
Space Complexity: O(1)Explanation:
O(1),
 
The space complexity of the approach is O(1) b...read more
Answered by CodingNinjas
View 3 more amswers
Q3. Compress the String
Ninja has been given a program to do basic string compression. For a character that is consecutively repeated more than once, he needs to replace the consecutive duplicate occurrences w...read more
Ans. Greedy Approach
Here, we can simply traverse the string and run two loops where the outer loop will hold the unique characters and the inner loop will count the consecutive repetitions of that character. Once, we encounter a new character, our inner loop breaks and now our outer loop will start again from the new character. In this process, while getting the repetitions of each character, we can append the character and...read more
Answered by CodingNinjas
Add your answer

Round duration - 40 minutes
Round difficulty - Medium

Timing Morning
Environment Online
Interviewer was very supportive during the Interview

Q1. Two Sum
You are 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 Target.
Note:
We cannot use th...read more
Ans. Hashing Solution
• We can store the frequency of every element in the array in a hashmap.
• We will loop over every index i, and check the frequency of (Target - ARR[i]) is the hashmap:
  • If (Target - ARR[i]) is equal to ARR[i], we will check if frequency of ARR[i] . If it is greater than 1 then we will decrease the frequency of ARR[i] by 2 and add a pair (ARR[i] , ARR[i]) to our answer.
  • Else, if the frequency of ARR[i] and Targ...read more
Answered by CodingNinjas
Add your answer
Q2. Trapping Rain Water
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. Pri...read more
Ans. Brute Force Approach
The idea here is to travel over every elevation on the map and calculate the units of water the elevation can store.
 
Here is the algorithm :
 
1. Iterate over every elevation or element and find the maximum elevation on to the left and right of it. Say, the maximum elevation on to the left of the current elevation or element that we are looking at is ‘maxLeftHeight’ and the maximum elevation on...read more
Answered by CodingNinjas
View 2 more amswers
Q3. Spiral Order Traversal of a Binary Tree
You have been given a binary tree of 'N' nodes. Print the Spiral Order traversal of this binary tree.
For example
For the given binary tree [1, 2, 3, -1, -...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 by CodingNinjas
View 1 more amswer

Round duration - 20 minutes
Round difficulty - Easy

Timing Morning
Environment Online
Interviewer was friendly

Q1. Basic HR Questions
Introduce Yourself
Strengths and Weakness
Brief discussion about Internship
Ans. 
Tip 1 : You should be confident during your introduction as it gives your first impression to the interviewer.
Tip 2 : You should be honest.
Tip 3 : Don't Hesitate.
Answered by CodingNinjas
Add your answer