Nagarro Software Developer Interview Questions, Process, and Tips

Round duration - 90 minute
Round difficulty - Hard

The test comprises of aptitude question in 1 half and aptitude question in 2 half then there is a coding round with 3 question and one was easy one was of medium and one was from hard, a deep understanding of question was a must

Q1. 
Pair Sum Problem Statement
You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to find and return a list of all pairs of elements where each sum of a pair equals 'S'.
Note:
...read more
Ans. 
Find pairs of elements in an array that sum up to a given value, sorted in a specific order.
• Iterate through the array and use a hashmap to store the difference between the target sum and each element.

• Check if the current element's complement exists in the hashmap, if so, add the pair to the result list.

• Sort the pairs based on the criteria mentioned in the question.

• Return the list of pairs as the final output.
Answered by AI
Add your answer
Q2. 
Rotational Equivalence of Strings Problem Statement
Given two strings 'P' and 'Q' of equal length, determine if string 'P' can be transformed into string 'Q' by cyclically rotating it to the right any num...read more
Ans. 
Check if one string can be transformed into another by cyclically rotating it to the right.
• Iterate through all possible rotations of string P and check if any of them match string Q.

• Use string concatenation and substring operations to simulate the rotation.

• Optimize the solution to O(N) time complexity by checking if string Q is a substring of P concatenated with itself.
Answered by AI
Add your answer
Q3. 
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. 
Find 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 while calculating the height.
Answered by AI
Add your answer

Round duration - 48 minutes
Round difficulty - Medium

This round was the most difficult round the interviewer was quite helpful and helped me throughout the interview

Q1. 
Code Optimization Problem
Ninja encountered an issue with a practice problem where certain test cases could not be passed due to high time complexity. You are provided with a snippet of pseudocode, and yo...read more
Ans. 
Optimize pseudocode to compute XOR operations in a given range and return sum modulo 1000000007.
• Use bitwise XOR properties to optimize the computation.

• Avoid unnecessary nested loops by simplifying the logic.

• Consider using modular arithmetic to handle large numbers efficiently.
Answered by AI
Add your answer
Q2. 
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 a given array.
• Iterate through the array and keep track of the maximum sum subarray seen so far.

• Use Kadane's algorithm to efficiently find the maximum subarray sum.

• Handle cases where all elements in the array are negative.

• Consider the sum of an empty subarray as 0.
Answered by AI
Add your answer

Round duration - 20 Minutes
Round difficulty - Easy

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.There was a 1 hour gap b/w the two tests.

Q1. 
Count Derangements
Determine the number of derangements possible for a set of 'N' elements. A derangement is a permutation where no element appears in its original position.
Input:
An integer 'T' repres...read more
Ans. 
Count the number of derangements possible for a set of 'N' elements.
• Derangement is a permutation where no element appears in its original position.

• Use dynamic programming to calculate derangements efficiently.

• Apply the formula: D(n) = (n-1) * (D(n-1) + D(n-2)), with base cases D(1) = 0 and D(2) = 1.
Answered by AI
Add your answer
Q2. 
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 better efficiency

• Optimize by only checking up to the square root of N for divisors
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 problem requires identifying and outputting common strings present in two 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 - 60 Minutes
Round difficulty - Medium

This round had 1 question from DSA particulary Trees and after that some questions from OOPS were asked.

Q1. 
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. 
Implement a function to return the spiral order traversal of a binary tree.
• Traverse the binary tree level by level, alternating the direction of traversal.

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

• Append nodes to the result list based on the traversal direction.

• Handle null nodes appropriately to maintain the spiral order.

• Example: Input: 1 2 3 -1 -1 4 5, Output: 1 3 2 4 5
Answered by AI
Add your answer
Q2. What is the difference between an Abstract Class and an Interface in Java?
Ans. 
Abstract class can have both abstract and non-abstract methods, while interface can only have abstract methods.
• Abstract class can have constructor, fields, and methods, while interface can only have constants and abstract methods.

• A class can extend only one abstract class, but can implement multiple interfaces.

• Abstract classes are used to provide a common base for subclasses, while interfaces are used to define a contr...read more
Answered by AI
Add your answer
Q3. What is the static keyword in Java?
Ans. 
The static keyword in Java is used to create class-level variables and methods that can be accessed without creating an instance of the class.
• Static variables are shared among all instances of a class.

• Static methods can be called without creating an object of the class.

• Static blocks are used to initialize static variables.

• Example: public static int count = 0;
Answered by AI
Add your answer
Q4. What is the difference between a constructor and a method in Object-Oriented Programming?
Ans. 
Constructor is a special method used to initialize objects, while a method is a regular function that performs a specific task.
• Constructors are called automatically when an object is created, while methods need to be called explicitly.

• Constructors have the same name as the class, while methods have unique names.

• Constructors do not have a return type, while methods have a return type.

• Example: Constructor - public ClassN...read more
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

This round had 2 questions from DSA and after that some basic HR questions were asked.

Q1. 
Ways To Make Coin Change
Given an infinite supply of coins of varying denominations, determine the total number of ways to make change for a specified value using these coins. If it's not possible to make...read more
Ans. 
The task is to find the total number of ways to make change for a specified value using given denominations.
• Use dynamic programming to solve this problem efficiently.

• Create a 1D array to store the number of ways to make change for each value from 0 to the target value.

• Iterate through the denominations and update the array based on the current denomination.

• The final answer will be the value at the target index of the ar
Answered by AI
Add your answer
Q2. 
Palindrome String Validation
Determine if a given string 'S' is a palindrome, considering only alphanumeric characters and ignoring spaces and symbols.
Note:
The string 'S' should be evaluated in a case...read more
Ans. 
Check if a given string is a palindrome after removing special characters, spaces, and converting to lowercase.
• Remove special characters and spaces from the input string

• Convert the string to lowercase

• Check if the modified string is a palindrome by comparing characters from start and end
Answered by AI
Add your answer