i
Nagarro
Filter interviews by
I applied via Naukri.com and was interviewed in Mar 2022. There were 5 interview rounds.
30 minutes 25 questions. Difficulty moderate.
I applied via Job Portal and was interviewed before Feb 2023. There were 3 interview rounds.
Coding was moderate and the level was not too high but standard. Had required a good concept of DSA and hands on coding.
I applied via Walk-in and was interviewed in Dec 2021. There were 3 interview rounds.
In the coding test, you will get three coding questions. You have to do all questions for the software developer profile. The Level of the question, first is easy or medium level, the second from medium level, and the third from hard level. If you are a good coder then you will not get the problems. you will get selected. Apart from that, two more questions are having there for the senior Developer profile. If you will solve at least one question from them then you will select from the senior developer profile.
Binary tree is a data structure where each node has at most two children. Heap is a specialized tree-based data structure. Array is a collection of elements stored in contiguous memory locations.
Binary tree can be implemented using linked lists or arrays.
Heap is used to efficiently implement priority queues.
Sorting algorithms like bubble sort, insertion sort, merge sort, quick sort can be used to sort arrays.
Coding pro...
Yes, I am open to relocation for the right opportunity.
I am willing to relocate for a position that aligns with my career goals and offers growth opportunities.
I am open to considering relocation packages and assistance.
I am excited about the prospect of exploring new cities and cultures.
Examples: I have previously relocated for a job and found it to be a positive experience.
I am willing to discuss relocation during th
What people are saying about Nagarro
I applied via Company Website and was interviewed before Sep 2023. There was 1 interview round.
Was good. 1 easy and 1 normal
Nagarro interview questions for popular designations
I appeared for an interview 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
Get interview-ready with Top Nagarro Interview Questions
I applied via Campus Placement and was interviewed before Jan 2023. There were 4 interview rounds.
All Basic Aptitude Topics Like - Mensuration, Time Distance and Speed, Volumes, Weights etc.
5 Questions Were Asked - 3 Questions were Easy - Medium and 2 were Medium-Hard Level. 3 out of 5 questions required Dynamic Programming.
I applied via Campus Placement
Easy to medium 70 questions around were their.
Five questions were their, rated easy medium and two hard
I applied via Campus Placement and was interviewed in Feb 2022. There were 6 interview rounds.
Profit and loss,mixture,percentage,reasoning ,series,statics,airthmatic(basic)
3 question on coding like topic on arrray ,string,twopointer approach,basic graph,tree basic
Advance coding round:-2 question topic:-greedy,dp,graph,tree
A technical interview question on various computer science concepts.
Stack is a data structure that follows the Last-In-First-Out (LIFO) principle.
Undo-Redo is a feature that allows users to reverse or repeat actions in software applications.
Backward and forward in the browser refers to navigating to previously visited or next pages.
Polymorphism is the ability of an object to take on multiple forms or behaviors.
To find ...
I applied via Walk-in and was interviewed before May 2023. There were 2 interview rounds.
Logical questions. Maths
I appeared for an interview in Oct 2021.
Round duration - 180 minutes
Round difficulty - Easy
5 Coding Questions and few mcq
You are given the arrival and departure times of N trains at a railway station for a particular day. Your task is to determine the minimum number of pl...
The problem involves determining the minimum number of platforms needed at a railway station based on arrival and departure times of trains.
Sort the arrival and departure times in ascending order.
Use two pointers to keep track of overlapping schedules.
Increment platform count when a train arrives and decrement when it departs.
Return the maximum platform count needed.
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...
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.
Given the stock prices for 'N' days, your goal is to determine the maximum profit that can be achieved. You can buy and sell the stocks any number of times but can onl...
The goal is to determine the maximum profit that can be achieved by buying and selling stocks on different days.
Iterate through the stock prices and buy on days when the price is lower than the next day, and sell on days when the price is higher than the next day.
Calculate the profit by summing up the differences between buying and selling prices.
Repeat the process for each test case and output the maximum profit possi
Given an array ARR
of integers with size N
, where all elements appear an even number of times except for one element which appears an odd number of times, identify the element tha...
Identify the element that appears an odd number of times in an array of integers where all other elements appear an even number of times.
Iterate through the array and use XOR operation to find the element that appears an odd number of times.
XOR of a number with itself is 0, so XOR of all elements will give the odd occurring element.
Return the result after XORing all elements in the array.
You are given a string consisting of English alphabet characters. Your task is to identify and return the first character in the string that does not repeat...
Identify and return the first non-repeating character in a string, or the first character if all characters repeat.
Iterate through the string to count the frequency of each character
Return the first character with a frequency of 1, or the first character if all characters repeat
Use a hashmap to store character frequencies efficiently
Round duration - 30 minuted
Round difficulty - Easy
It is based on Data structures and OOPS concepts . Projects was discussed in this round
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...
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 2D array to store the number of ways to make change for each value up to the specified value.
Iterate through the denominations and update the array based on the current denomination.
The final answer will be the value at the last cell of the array.
Tip 1 - Practice Atleast 250 Questions
Tip 2 - Ex- Do atleast 2 projects
Tip 1 : Have some projects on resume.
Tip 2 : Do not put false things on resume.
Some of the top questions asked at the Nagarro interview for freshers -
The duration of Nagarro interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 43 interviews
Interview experience
based on 4.2k reviews
Rating in categories
Associate Staff Engineer
3.3k
salaries
| ₹10 L/yr - ₹36 L/yr |
Staff Engineer
3.1k
salaries
| ₹14.9 L/yr - ₹43.2 L/yr |
Senior Engineer
2.4k
salaries
| ₹6.2 L/yr - ₹23.8 L/yr |
Senior Software Engineer
1.1k
salaries
| ₹5.1 L/yr - ₹27.8 L/yr |
Engineer
972
salaries
| ₹3 L/yr - ₹11.3 L/yr |
Deloitte
Cognizant
TCS
Accenture