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. 
Find the maximum sum of a simple path between any two nodes in a binary tree.
• Use a recursive approach to traverse the binary tree and calculate the maximum sum path.

• Keep track of the maximum sum path found so far while traversing the tree.

• Consider negative values in the path sum calculation to handle cases where the path can start and end at different nodes.

• Handle cases where the path can go through the root node or no
Answered by AI
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
Ans. 
In an undirected graph with distinct edge weights, the lightest edge in a cycle is included in every MST, while the heaviest edge is excluded.
• The lightest edge in a cycle is always included in every MST of the graph.

• The heaviest edge in a cycle is always excluded from every MST of the graph.

• This property holds true for all simple undirected graphs with distinct edge weights.
Answered by AI
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. 
Calculate uneaten carrots after rabbits jump based on their unique factors.
• Iterate through each rabbit's jumping factor and mark the carrots they land on as eaten

• Calculate the remaining uneaten carrots by counting the ones not marked as eaten

• Consider using a data structure like an array to keep track of eaten carrots efficiently
Answered by AI
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
Ans. 
Find the closest perfect square to a given positive integer and determine the number of steps required to reach that number.
• Iterate through perfect squares starting from 1 until the square is greater than the given number

• Calculate the distance between the perfect square and the given number

• Return the closest perfect square and the distance as output
Answered by AI
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 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
Ans. 
The problem involves determining the number of distinct ways to climb from the 0th to the Nth stair by climbing one or two steps at a time.
• Use dynamic programming to solve this problem efficiently.

• The number of ways to reach the Nth stair can be calculated by adding the number of ways to reach the (N-1)th stair and the (N-2)th stair.

• Consider base cases where N=0 and N=1 separately.

• Handle large values of N by using modu...read more
Answered by AI
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
Ans. 
To find the Nth prime number given a number N, implement a function that returns the Nth prime number.
• Create a function that takes N as input and returns the Nth prime number.

• Iterate through numbers starting from 2 and check if each number is prime.

• Keep track of the count of prime numbers found until reaching the Nth prime number.

• Return the Nth prime number once it is found.
Answered by AI
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
Ans. 
Implement a function to compress a string by replacing consecutive characters with the character followed by the count of repetitions.
• Iterate through the input string and keep track of consecutive characters and their counts.

• Replace consecutive characters with the character followed by the count of repetitions if count is greater than 1.

• Return the compressed string for each test case.
Answered by AI
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
Ans. 
The task is to find all pairs of elements in an array that add up to a given target.
• Iterate through the array and for each element, check if the target minus the element exists in a hash set.

• If it exists, add the pair to the result. If not, add the element to the hash set.

• Print the pairs found or (-1, -1) if no pair is found.
Answered by AI
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
Ans. 
Calculate the total amount of rainwater that can be trapped between given elevations in an array.
• Iterate through the array and calculate the maximum height on the left and right of each bar.

• Calculate the amount of water that can be trapped at each bar by taking the minimum of the maximum heights on the left and right.

• Sum up the trapped water at each bar to get the total trapped water for the entire array.
Answered by AI
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
Ans. 
The task is to output the Spiral Order traversal of a binary tree given in level order.
• Implement a function that returns the spiral order traversal as a list

• Traverse the binary tree in a spiral order, alternating between left to right and right to left

• Use a queue to keep track of nodes at each level

• Handle null nodes appropriately in the traversal

• Example: Input: 1 2 3 -1 -1 4 5, Output: 1 3 2 4 5
Answered by AI
Add your answer

Round duration - 20 minutes
Round difficulty - Easy

Timing Morning
Environment Online
Interviewer was friendly

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. 
Find the Nth prime number given a number N.
• A prime number is greater than 1 and is not the product of two smaller natural numbers

• A prime number has exactly two distinct positive divisors: 1 and itself

• Implement a function to find the Nth prime number based on the given input
Answered by AI
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. 
Check if second string can be formed using characters from the first string.
• Iterate through each character in STR2 and check if it exists in STR1.

• Use a hashmap to store the frequency of characters in STR1 for efficient lookup.

• Return 'YES' if all characters in STR2 are found in STR1, otherwise return 'NO'.
Answered by AI
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. 
Count the total number of derangements possible for a set of 'N' elements.
• A derangement is a permutation where no element appears in its original position.

• Use the formula for derangements: !n = n! * (1 - 1/1! + 1/2! - 1/3! + ... + (-1)^n/n!)

• Return the answer modulo (10^9 + 7) to handle large results.
Answered by AI
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. 
Detect and remove loop in a singly linked list in place with O(n) time complexity and O(1) space complexity.
• Use Floyd's Cycle Detection Algorithm to identify the loop in the linked list.

• Once the loop is detected, use two pointers to find the start of the loop.

• Adjust the pointers to remove the loop and return the modified linked list.
Answered by AI
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. 
The task is to output the Spiral Order traversal of a binary tree given in level order.
• Implement a function that returns the spiral order traversal as a list

• Traverse the binary tree in a spiral order alternating between left to right and right to left

• Use a queue to keep track of nodes at each level

• Handle null nodes represented by -1 in the input
Answered by AI
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. 
Calculate the total amount of rainwater that can be trapped within given elevation map.
• Iterate through the array to find the maximum height on the left and right of each bar.

• Calculate the amount of water that can be trapped above each bar by taking the minimum of the maximum heights on the left and right.

• Sum up the trapped water above each bar to get the total trapped water for the elevation map.
Answered by AI
Add your answer

Round duration - 20 minutes
Round difficulty - Easy

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