Nagarro Software Developer Intern Interview Questions and Answers

Round duration - 120 mintues
Round difficulty - Medium

Aptitude round was in afternoon around 3 pm and every person who has given aptitude round was also given an other chance which was coding round. There was a time gap of 1 hr between two test. both of these went online. Environment was good without any lag. Webcam was on throughout the test. There were 3 coding questions, of which 2 were medium and one was easy. I attempted all of them.

Q1. 
String Rotation Problem Statement
You are given a string named str and an integer D. Your task is to perform both left (anticlockwise) and right (clockwise) rotations on the given string by D units, start...read more
Ans. 
Implement left and right string rotations by D units on a given string.
• Implement leftRotate() function to return string after left rotation by D units.

• Implement rightRotate() function to return string after right rotation by D units.

• Consider handling edge cases like empty string or D exceeding string length.

• Example: For input 'coding', D=2, leftRotate() should return 'dingco' and rightRotate() should return 'ngcodi'.
Answered by AI
Add your answer
Q2. 
Height of Binary Tree
You are provided with the Inorder and Level Order traversals of a Binary Tree composed of integers. Your goal is to determine the height of this Binary Tree without actually construc...read more
Ans. 
Calculate the height of a Binary Tree given its Inorder and Level Order traversals without constructing it.
• Use the properties of Inorder and Level Order traversals to determine the height of the Binary Tree.

• The height of a Binary Tree is the number of edges on the longest path from the root to a leaf node.

• Consider edge cases like a single node tree or empty tree when calculating the height.
Answered by AI
Add your answer
Q3. 
Common Elements Problem Statement
Identify and output the common strings present in both given arrays of lowercase alphabets for each test case.
Input:
The first line contains an integer 'T' representin...read more
Ans. 
The task is to find and output the common strings present in both given arrays of lowercase alphabets for each test case.
• Iterate through the elements of the second array and check if they are present in the first array.

• Use a hash set or map to efficiently check for common elements.

• Return the common strings in the order they appear in the second array.
Answered by AI
Add your answer

Round duration - 40 minutes
Round difficulty - Medium

This round was at 12 pm. Interviewer and I greeted each other and then he asked me to explain all the questions I had done during test. He shared screen with my report of test which was having the solutions I typed during coding rounds. It took around 20 minutes to explain all three questions. Interviewer was happy with my explanation. Then he had asked me one coding question and various questions based on my project. I answered him all with a smile.

Q1. 
Maximum Subarray Sum Problem Statement
Given an array arr of length N consisting of integers, find the sum of the subarray (including empty subarray) with the maximum sum among all subarrays.
Explanation...read more
Ans. 
Find the sum of the subarray with the maximum sum among all subarrays in an array of integers.
• Use Kadane's algorithm to find the maximum subarray sum efficiently.

• Initialize two variables, one for current sum and one for maximum sum.

• Iterate through the array and update the current sum and maximum sum accordingly.

• Return the maximum sum as the result.
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Medium

It was in afternoon. HR called to me to fix a meeting on Microsoft teams. He was very polite with experience of corporate environment.

Round duration - One hour aptitude,1.5 hour coding
Round difficulty - Medium

First round was of aptitude that was easy and second round was of coding which had medium level questions.

Q1. 
Prime Numbers Identification
Given a positive integer N, your task is to identify all prime numbers less than or equal to N.
Explanation:
A prime number is a natural number greater than 1 that has no po...read more
Ans. 
Identify all prime numbers less than or equal to a given positive integer N.
• Iterate from 2 to N and check if each number is prime

• Use the Sieve of Eratosthenes algorithm for efficient prime number identification

• Optimize by only checking up to the square root of N for divisors
Answered by AI
Add your answer

Round duration - 20 minutes
Round difficulty - Medium

First I was asked about my projects and then 2 questions on array were given.

Q1. 
Count Pairs with Given Sum
Given an integer array/list arr and an integer 'Sum', determine the total number of unique pairs in the array whose elements sum up to the given 'Sum'.
Input:
The first line c...read more
Ans. 
Count the total number of unique pairs in an array whose elements sum up to a given value.
• Use a hashmap to store the frequency of each element in the array.

• Iterate through the array and for each element, check if (Sum - current element) exists in the hashmap.

• Increment the count of pairs if the complement exists in the hashmap.

• Divide the count by 2 to avoid counting duplicates (arr[i], arr[j]) and (arr[j], arr[i]) separ...read more
Answered by AI
Add your answer