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
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
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
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
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
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
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
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
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
Add your answer
Q2. What is the difference between an Abstract Class and an Interface in Java?
Add your answer
Q3. What is the static keyword in Java?
Add your answer
Q4. What is the difference between a constructor and a method in Object-Oriented Programming?
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
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
Add your answer

Round duration - 45 Minutes
Round difficulty - Easy

The round was conducted at 12 in the college campus. It was a pen and paper based coding round and had 2 coding questions for which we had to write the best approach.

Q1. 
Equilibrium Index Problem Statement
Given an array Arr consisting of N integers, your task is to find the equilibrium index of the array.
An index is considered as an equilibrium index if the sum of elem...read more
Add your answer
Q2. 
Merge Sort Linked List Problem Statement
You are given a singly linked list of integers. Your task is to sort the linked list using the merge sort algorithm.
Explanation:
Merge Sort is a divide and conq...read more
Add your answer

Round duration - 45 Minutes
Round difficulty - Easy

There were 2 coding questions and we had to write the best approach for the questions.

Q1. 
Convert Sentence Problem Statement
Convert a given string 'S' into its equivalent representation based on a mobile numeric keypad sequence. Using the keypad layout shown in the reference, output the seque...read more
Add your answer
Q2. 
Subsequences of String Problem Statement
You are provided with a string 'STR' that consists of lowercase English letters ranging from 'a' to 'z'. Your task is to determine all non-empty possible subsequen...read more
Add your answer

Round duration - 40 minutes
Round difficulty - Easy

The interviewer asked me questions from arrays, strings and linked list.

Q1. 
Longest Increasing Subsequence Problem Statement
Given an array of integers with 'N' elements, determine the length of the longest subsequence where each element is greater than the previous element. This...read more
Add your answer
Q2. 
Binary Palindrome Check
Given an integer N, determine whether its binary representation is a palindrome.
Input:
The first line contains an integer 'T' representing the number of test cases. 
The next 'T'...read more
Add your answer