i
Nagarro
Filter interviews by
Clear (1)
DSA questions of array and strings
I was interviewed in Dec 2021.
Round duration - 90 minutes
Round difficulty - Medium
This round contains 40 mcq questions 15 dsa and 25 aptitude.
then there was 5 coding questions.
Given an integer N
, determine if its binary representation is a palindrome.
The first line contains a single integer ‘T’ representing the ...
Check if the binary representation of a number is a palindrome.
Convert the integer to binary representation.
Check if the binary representation is a palindrome by comparing it with its reverse.
Return true if it is a palindrome, false otherwise.
You are given a list of N
strings called A
. Your task is to determine whether you can form a given target string by combining one or more strings from A
.
The strings from A
c...
Given a list of strings, determine if a target string can be formed by combining one or more strings from the list.
Iterate through all possible combinations of strings from the list to check if they can form the target string.
Use recursion to try different combinations of strings.
Keep track of the current position in the target string and the strings used so far.
Return true if the target string can be formed, false oth
Round duration - 25 minutes
Round difficulty - Easy
Technical Round
Given an integer array ARR
of size N
containing only integers 0 and 1, implement a function to sort this array. The solution should scan the array only once without using an...
Sort an array of 0s and 1s in linear time without using additional arrays.
Use two pointers approach to swap 0s to the left and 1s to the right.
Maintain two pointers, one for 0s and one for 1s, and iterate through the array.
Swap elements at the two pointers based on the values encountered.
Continue until the two pointers meet in the middle of the array.
Tip 1 : Practice well basics of dsa
Tip 2 : Have a good grip of core cs
Tip 3 : have good projects on resume
Tip 1 : Don't put anything which you are not comfortable to speak
Tip 2 : make it short and crisp
I applied via Campus Placement and was interviewed before Oct 2022. There were 5 interview rounds.
Normal MCQ style questions involving basic concepts
2 coding questions: 1st one average, 2nd one slightly better than average.
What people are saying about Nagarro
I was interviewed in Dec 2020.
Round duration - 30 Minutes
Round difficulty - Easy
he interviews were conducted simultaneously for all on BlueJeans along with a code sharing website. After the initial set up and introduction, a set of 2 questions from DSA were asked from all candidates. The results were announced the same day.
Given an undirected and disconnected graph G(V, E)
, where V
is the number of vertices and E
is the number of edges, the connections between vertices are provided in the 'GR...
DFS traversal to find connected components in an undirected and disconnected graph.
Use Depth First Search (DFS) algorithm to traverse the graph and find connected components.
Maintain a visited array to keep track of visited vertices.
For each unvisited vertex, perform DFS to explore all connected vertices and form a connected component.
Given two sorted arrays A
and B
of sizes N
and M
, find the median of the merged array formed by combining arrays A
and B
. If the total number of elements, N + M
, is even, the m...
Find the median of two sorted arrays by merging them and calculating the middle element(s).
Merge the two sorted arrays into one sorted array.
Calculate the median based on the total number of elements in the merged array.
If the total number of elements is even, take the mean of the two middle elements as the median.
Tip 1 : Don't forget to revise OOPS, OS, DBMS too.
Tip 2 : During the interview, one thing that is asked for sure is the time complexity of your solution, so always know the complexity of your algorithms.
Tip 3 : Try out mock interviews with friends, that's the best thing you can do for yourself other than practicing
questions
Tip 1 : Make sure that there are no formatting errors
Tip 2 : Have your projects clearly mentioned and well explained
Nagarro interview questions for designations
I was interviewed in Oct 2020.
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.
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...
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'.
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...
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.
Identify and output the common strings present in both given arrays of lowercase alphabets for each test case.
The first line contains an integer 'T' representin...
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.
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.
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.
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.
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.
Tip 1 : Properly grasp Data Structures and Algorithms from basics. Cramming problems would not help.
Tip 2 : Try platforms like code-zen for practice. Its a good platform with selected questions.
Tip 3 : Do at least 2 projects in which you are confident enough to answer anything the interviewer ask.
Tip 4 : Be confident with a smile on face during interviews.
Tip 1 : Just one page resume, not more than that for freshers.
Tip 2 : Make it as attractive/catchy as you can. Interviewers don't spend much time while reading your resume.
Get interview-ready with Top Nagarro Interview Questions
I was interviewed in Sep 2020.
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.
Given a positive integer N
, your task is to identify all prime numbers less than or equal to N
.
A prime number is a natural number greater than 1 that has no po...
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
Round duration - 20 minutes
Round difficulty - Medium
First I was asked about my projects and then 2 questions on array were given.
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'.
The first line c...
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
Tip 1 : Data structures should be on your tips.
Tip 2 : Learn how to make logic.
Tip 3 : Be confident while giving the interview.
Tip 1 : Add projects with description.
Tip 2 : Be true to yourself in resume.
I was interviewed before Sep 2020.
Round duration - 140 minutes
Round difficulty - Medium
Test timing was at 2:00 pm , it was conducted in a college and the environment was good for the test. Camera was a primary part of test, so no suspicious activity.
Given two numbers in the form of two arrays where each element of the array represents a digit, calculate the sum of these two numbers and return this sum as an ar...
Given two numbers represented as arrays, calculate their sum and return the result as an array.
Iterate through the arrays from right to left, adding digits and carrying over if necessary
Handle cases where one array is longer than the other by considering the remaining digits
Ensure the final sum array does not have any leading zeros
Round duration - 20 minutes
Round difficulty - Easy
The round was conducted at around 12 p.m. I was called at the college location and then it was conducted. The interviewer was quite polite and frank.
Round duration - 8 minutes
Round difficulty - Easy
This round was conducted right after finishing and clearing the technical round at the same place and on the same day.
Tip 1 : Practice atleast 2-3 Coding problems daily so your logic building becomes stronger.
Tip 2 : Exercise problems based on OOPS concepts and others too.
Tip 3 : If you can have your own project built, then it's the major point and will act as a plus point.
Tip 1 : Your resume should be in standard form, short and simple will be more effective.
Tip 2 : Whatever you have learned, you need to mention it in your resume as that will be your primary source of selection and having project on your resume is important.
I applied via Naukri.com and was interviewed in Jul 2020. There were 4 interview rounds.
I applied via Job Portal and was interviewed before Apr 2021. There was 1 interview round.
Solid principles are a set of design principles for writing maintainable and scalable code in C#.
Single Responsibility Principle (SRP) - a class should have only one reason to change
Open/Closed Principle (OCP) - a class should be open for extension but closed for modification
Liskov Substitution Principle (LSP) - derived classes should be substitutable for their base classes
Interface Segregation Principle (ISP) - client...
I applied via Campus Placement and was interviewed before Feb 2020. There were 4 interview rounds.
Some of the top questions asked at the Nagarro Software Developer Intern interview -
based on 2 interviews
2 Interview rounds
based on 2 reviews
Rating in categories
Associate Staff Engineer
2.9k
salaries
| ₹0 L/yr - ₹0 L/yr |
Staff Engineer
2.9k
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Engineer
2.4k
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
1.1k
salaries
| ₹0 L/yr - ₹0 L/yr |
Engineer
896
salaries
| ₹0 L/yr - ₹0 L/yr |
Deloitte
Cognizant
TCS
Accenture