i
Nagarro
Filter interviews by
I applied via Naukri.com and was interviewed in Oct 2023. There were 3 interview rounds.
There is 40 question and timming in 1 hr
Abs is a class in Java that provides mathematical functions for absolute values, while Interface is a blueprint for classes to implement certain methods.
Abs is a class in Java that provides static methods for mathematical operations like abs(), max(), min().
Interface in Java is a blueprint for classes to implement certain methods without specifying the implementation details.
Abs class is used for mathematical operation...
I was interviewed in May 2022.
Round duration - 60 Minutes
Round difficulty - Medium
First round has 4 coding Questions in which i have solved 3 complete and 1 partial.
Ninja enjoys arranging numbers in a sequence. He plans to arrange them in 'N' rows such that:
Arrange numbers in a sequence in 'N' rows with increasing order and repeating after 9.
Iterate through each test case and for each row, print numbers in increasing order with a loop.
Keep track of the current number to print and reset to 1 after reaching 9.
Handle formatting to align numbers correctly in each row.
Ensure to print the correct number of rows based on the input 'N'.
Given an array of integers and an integer K
, determine and print the count of all pairs in the array that have an absolute difference of K
.
The first line of the inp...
Count pairs in an array with a specific absolute difference.
Iterate through the array and for each element, check if the element + K or element - K exists in the array.
Use a hash set to store elements for constant time lookups.
Keep track of the count of valid pairs found.
Given an integer N
, determine if it is a member of the Fibonacci series. Return true
if the number is a member of the Fibonacci series, otherwise return false
.
Check if a given integer is a member of the Fibonacci series.
Implement a function to check if the given number is a perfect square.
Check if 5*N^2 + 4 or 5*N^2 - 4 is a perfect square to determine Fibonacci membership.
Return true if the number is a perfect square of 5*N^2 + 4 or 5*N^2 - 4, otherwise false.
Ninja has organized a new year party and wants to verify if the guests are programmers by challenging them with a coding task. As an invited programmer, you're tasked...
Compute the number of valid permutations of integers from 0 to N-1 such that at least K positions satisfy ARR[I] = I.
Use dynamic programming to solve the problem efficiently.
Consider the cases where K is equal to N or N-1 separately.
Modulo the result by 10^9 + 7 to avoid overflow issues.
Round duration - 20 minutes
Round difficulty - Easy
Every single question were based on the concept of data structure.
I have to answer my approach for solving a particular real life Problem.
Given a string 'STR' consisting solely of the characters “{”, “}”, “(”, “)”, “[” and “]”, determine if the parentheses are balanced.
The first line contains an...
The task is to determine if given strings containing only parentheses are balanced or not.
Iterate through each character in the string and use a stack to keep track of opening parentheses.
If a closing parenthesis is encountered, check if the stack is empty or if the top of the stack matches the corresponding opening parenthesis.
If all parentheses are balanced, the stack should be empty at the end.
Return 'Balanced' if t...
Round duration - 15 minutes
Round difficulty - Easy
Tip 1 : Focus majorly on Data Structures and algorithms
Tip 2 : Master on One Programming Fundamentals
Tip 3 : Build one live Project on any tech stack.
Tip 1 : Be concise and Confident what you have written in your resume.
Tip 2 : Make sure to mention any coding Profile which u practice on and one live project.
What people are saying about Nagarro
I was interviewed in May 2022.
Round duration - 120 minutes
Round difficulty - Medium
30 aptitude MCQ, 3 coding questions
environment was good, smooth
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 in linear time complexity.
Initialize two variables: maxEndingHere and maxSoFar to keep track of the current subarray sum and the maximum subarray sum found so far.
Iterate through the array and update the variables accordingly.
Return the maxSoFar as the result.
You are given a string S
containing digits from 2 to 9 inclusive. Your task is to find all possible letter combinations that the number could repres...
Given a string of digits, find all possible letter combinations based on phone keypad mapping.
Use a recursive approach to generate all possible combinations of letters for each digit in the input string.
Create a mapping of digits to corresponding letters on a phone keypad.
Iterate through the input string and generate combinations by combining letters for each digit.
Return the list of all possible letter combinations as
Given a binary tree, compute the zigzag level order traversal of the node values in the tree. The zigzag traversal requires traversing levels from left to right, then ...
Zigzag level order traversal of a binary tree is computed by alternating between left to right and right to left traversal at each level.
Use a queue to perform level order traversal of the binary tree.
Maintain a flag to switch between left to right and right to left traversal at each level.
Store the node values in a list while traversing and alternate the order based on the flag.
Example: For input 1 2 3 4 -1 5 6 -1 7 -...
Round duration - 45 minutes
Round difficulty - Easy
He asked me about projects and about my resume, and some coding problems
Given an array/list ARR
consisting of integers where each element is either 0, 1, or 2, your task is to sort this array in increasing order.
The input sta...
Sort an array of 0s, 1s, and 2s in increasing order.
Use a three-pointer approach to partition the array into sections of 0s, 1s, and 2s.
Iterate through the array and swap elements based on their values and the pointers.
After sorting, the array will have 0s on the left, 1s in the middle, and 2s on the right.
Round duration - 20 minutes
Round difficulty - Easy
he asked me basic questions about family background
Tip 1 : Resume should be crisp
Tip 2 : Do at least 2 projects
Tip 3 : Do practice
Tip 1 : Have some projects on resume.
Tip 2 : Resume should be crisp
Nagarro interview questions for designations
I applied via Campus Placement
Aptitude test consists of quant section tech section and reasoning section
Coding test contains five questions in which out of three based on software developer role and others two based on upgrade role
Get interview-ready with Top Nagarro Interview Questions
I applied via Naukri.com and was interviewed in Oct 2022. There were 3 interview rounds.
Test consists of MCQ and two Coding questions
Output of interval functions in JavaScript
Interval functions are used to execute a block of code repeatedly at a specified time interval
The output of the coding example will depend on the specific implementation of the interval function
Common interval functions in JavaScript include setInterval() and setTimeout()
Aptitude was basic which have to cover under 30 minutes.
Easy to medium level question, major questions comes from array, strings, dp and graph.
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
I applied via Walk-in and was interviewed before May 2023. There were 2 interview rounds.
Logical questions. Maths
I was interviewed 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 Software Developer interview -
The duration of Nagarro Software Developer interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 39 interviews
5 Interview rounds
based on 70 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