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

Q1. 
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 as output.
Answered by AI
View 1 more answer
Q2. 
K - Sum Path In A Binary Tree
Given a binary tree where each node contains an integer value, and a value 'K', your task is to find all the paths in the binary tree such that the sum of the node values in ...read more
Ans. 
Find all paths in a binary tree with nodes summing up to a given value K.
• Traverse the binary tree and keep track of the current path and its sum.

• At each node, check if the sum equals K and store the path if true.

• Recursively explore left and right subtrees while updating the path and sum.

• Return the list of paths that sum up to K in the binary tree.
Answered by AI
Add your answer
Q3. 
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
Ans. 
Find the length of the longest strictly increasing subsequence in an array of integers.
• Use dynamic programming to solve this problem efficiently.

• Initialize an array to store the length of the longest increasing subsequence ending at each index.

• Iterate through the array and update the length of the longest increasing subsequence for each element.

• Return the maximum value in the array as the result.
Answered by AI
Add your answer

Round duration - 45 Minutes
Round difficulty - Medium

This was also a Data Structures and Algorithms round where I was asked to solve 2 coding problems explaining my approach with proper Complexity Analysis . After the coding questions were over there was some time left so the interviewer asked me some concepts related to DBMS.

Q1. 
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
Q2. 
Next Permutation Problem Statement
You are given a permutation of 'N' integers. A sequence of 'N' integers is considered a permutation if it includes all integers from 1 to 'N' exactly once. Your task is ...read more
Ans. 
Given a permutation of 'N' integers, rearrange the numbers to form the lexicographically next greater permutation.
• Iterate from right to left to find the first element that is smaller than the element to its right.

• Swap this element with the smallest element to its right that is greater than it.

• Reverse the elements to the right of the swapped element to get the lexicographically next greater permutation.

• If no such elemen...read more
Answered by AI
Add your answer
Q3. Can you explain indexing in databases?
Ans. 
Indexing in databases is a technique used to improve the speed of data retrieval by creating a data structure that allows for quick lookups.
• Indexes are created on columns in a database table to speed up the retrieval of rows that match a certain condition.

• Types of indexes include B-tree, hash, and bitmap indexes.

• Indexes can improve the performance of SELECT queries but may slow down INSERT, UPDATE, and DELETE operation...read more
Answered by AI
Add your answer

Round duration - 45 Minutes
Round difficulty - Medium

This round was also held on Google Meet where I was supposed to code 2 problems in a Google Doc. After the coding questions , I was asked some core concepts related to OS .

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. 
Given an array of integers and a target, find all pairs of elements that add up to the 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.

• Handle cases where the same element is used twice to form a pair.

• Return (-1, -1) if no pair is found.
Answered by AI
Add your answer
Q2. 
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
Ans. 
Convert a given string into its equivalent representation based on a mobile numeric keypad sequence.
• Iterate through each character in the input string and map it to its corresponding numeric keypad sequence.

• Use a dictionary to store the mapping of characters to numeric sequences.

• Handle lowercase characters only and ignore special characters, capital letters, and spaces.
Answered by AI
Add your answer
Q3. What do you mean by FCFS?
Ans. 
FCFS stands for First-Come, First-Served. It is a scheduling algorithm where tasks are executed in the order they arrive.
• FCFS is a non-preemptive scheduling algorithm.

• Tasks are executed in the order they arrive in the queue.

• It is simple to understand and implement.

• Example: Consider a printer queue where print jobs are processed in the order they are submitted.
Answered by AI
Add your answer

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 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 finding the number of distinct ways to climb to the Nth stair by climbing one or two steps at a time.
• Use dynamic programming to solve the problem efficiently.

• The number of ways to reach the Nth stair is the sum of the number of ways to reach the (N-1)th stair and the (N-2)th stair.

• Handle base cases for N=0 and N=1 separately.

• Implement modulo operation to avoid overflow while calculating the result.

• ...read more
Answered by AI
Add your answer
Q2. 
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
Ans. 
Find the equilibrium index of an array where sum of elements on left equals sum on right.
• Iterate through array to calculate prefix and suffix sums

• Compare prefix and suffix sums to find equilibrium index

• Return -1 if no equilibrium index is found
Answered by AI
Add your answer
Q3. 
Closest Perfect Square Problem Statement
Given a positive integer 'N', determine the perfect square number closest to 'N' and the number of steps required to reach that perfect square.
Example:
Input:
...read more
Ans. 
Given a positive integer 'N', find the closest perfect square number and the steps required to reach it.
• Find the square root of N and round it to the nearest integer to get the closest perfect square.

• Calculate the difference between the closest perfect square and N to get the number of steps required.

• Return the closest perfect square and the number of steps as output.
Answered by AI
Add your answer

Round duration - 45 Minutes
Round difficulty - Medium

This round had 2 questions where I had to first explain my approach with proper complexity analysis and then write the pseudo code for the same.

Q1. 
Find the Longest Palindromic Substring
Given a string ‘S’ composed of lowercase English letters, your task is to identify the longest palindromic substring within ‘S’.
If there are multiple longest palin...read more
Ans. 
Find the longest palindromic substring in a given string, returning the rightmost one if multiple exist.
• Iterate through the string and expand around each character to find palindromes

• Keep track of the longest palindrome found and its starting index

• Return the substring starting from the index of the longest palindrome found
Answered by AI
Add your answer
Q2. 
Validate BST Problem Statement
Given a binary tree with N nodes, determine whether the tree is a Binary Search Tree (BST). If it is a BST, return true; otherwise, return false.
A binary search tree (BST)...read more
Ans. 
Validate if a given binary tree is a Binary Search Tree (BST) or not.
• Check if the left subtree of a node contains only nodes with data less than the node's data.

• Check if the right subtree of a node contains only nodes with data greater than the node's data.

• Recursively check if both the left and right subtrees are also binary search trees.

• Use level order traversal to construct the binary tree from input data.
Answered by AI
Add your answer

Round duration - 50 Minutes
Round difficulty - Medium

This round also had 2 questions from DS/Algo which were followed by some questions from DBMS and SQL.

Q1. 
Nearest Numbers with the Same Number of Set Bits
Given a positive integer n, your task is to determine the next smallest integer and the previous largest integer that have the same number of '1' bits in t...read more
Ans. 
Given a positive integer, find the next smallest and previous largest integers with the same number of set bits in their binary representation.
• Count the number of set bits in the binary representation of the given integer 'n'.

• Find the next smallest integer by iterating from 'n+1' onwards and checking for the same number of set bits.

• Find the previous largest integer by iterating from 'n-1' downwards and checking for the
Answered by AI
Add your answer
Q2. 
Find Duplicates in an Array
Given an array ARR of size 'N', where each integer is in the range from 0 to N - 1, identify all elements that appear more than once.
Return the duplicate elements in any orde...read more
Ans. 
Find duplicates in an array of integers within a specified range.
• Iterate through the array and keep track of the count of each element using a hashmap.

• Return elements with count greater than 1 as duplicates.

• Time complexity can be optimized to O(N) using a HashSet to store seen elements.
Answered by AI
Add your answer
Q3. What are the advantages of using views in a database management system?
Ans. 
Views in a database management system provide security, simplify complex queries, and improve performance.
• Enhanced security by restricting access to certain columns or rows

• Simplify complex queries by pre-defining joins and filters

• Improve performance by storing frequently used queries as views

• Reduce redundancy by storing common logic in views
Answered by AI
Add your answer
Q4. What are constraints in SQL?
Ans. 
Constraints in SQL are rules and restrictions applied to columns in a table to enforce data integrity.
• Constraints ensure data accuracy and consistency in a database.

• Common constraints include NOT NULL, UNIQUE, PRIMARY KEY, FOREIGN KEY, and CHECK constraints.

• NOT NULL constraint ensures a column cannot have a NULL value.

• UNIQUE constraint ensures all values in a column are unique.

• PRIMARY KEY constraint uniquely identifies...read more
Answered by AI
Add your answer

Q1. Detailed questions on Java- Strings code, exception handling and basic Oop
Add your answer
Q2. Detailed questions on Mysql
Add your answer
Q3. Detailed questions on Java 8
Add your answer
Q4. Detailed questions on Spring
Add your answer

Q1. What are your salary expectations?
Add your answer
Q2. Share details of your previous job.
Add your answer
Q3. Why should we hire you?
Add your answer
Q4. What are your strengths and weaknesses?
Add your answer
Q5. Tell me about yourself.
Add your answer

Q1. Why should we hire you?
Add your answer

Apti and Coding test...quite good level.

Q1. Interview is of high skill . Should brush everything.
Add your answer

Round duration - 90 Minutes
Round difficulty - Easy

This round was also conducted on Metll platform. This round is totally based on coding. There are so many choices in language, so you can easily select the language in which you are comfortable in. There are three problems to solve. I choose Java 8 to solve the problems. The problems are ranging from easy to hard-

To find the maximum occurring character in a given string.
To find the factorial of a given number.
Count Derangements.

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.
• Derangements are permutations where no element appears in its original position.

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

• Calculate the derangements modulo (10^9 + 7) for each test case.
Answered by AI
Add your answer
Q2. 
Factorial Calculation Problem Statement
Develop a program to compute the factorial of a given integer 'n'.
The factorial of a non-negative integer 'n', denoted as n!, is the product of all positive integ...read more
Ans. 
Program to compute factorial of a given integer 'n', with error handling for negative values.
• Create a function to calculate factorial using a loop or recursion

• Check if input is negative, return 'Error' if true

• Handle edge cases like 0 and 1 separately

• Use long data type to handle large factorials
Answered by AI
Add your answer
Q3. 
Most Frequent Word Problem Statement
You are given two strings 'A' and 'B' composed of words separated by spaces. Your task is to determine the most frequent and lexicographically smallest word in string ...read more
Ans. 
Find the most frequent and lexicographically smallest word in string 'A' that is not present in string 'B'.
• Split strings 'A' and 'B' into words

• Count frequency of each word in 'A'

• Check if word is not in 'B' and is the most frequent and lexicographically smallest

• Return the word or -1 if no such word exists
Answered by AI
Add your answer

Round duration - 90 Minutes
Round difficulty - Easy

The interviewer was so polite. He firstly asks me to describe myself and then ask about my family. After that he ask which language I choose to solve problems in Coding round and why I choose that language. Then he started to ask the technical questions.