AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
i
Nagarro
Compare
Filter interviews by
Nagarro Software Developer Intern Interview Questions and Answers
11 Interview questions
Word Break Problem Statement
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 ca...
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, fals...
Sort 0 and 1 Problem Statement
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 any...
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.
Check If Binary Representation of a Number is Palindrome
Given an integer N, determine if its binary representation is a palindrome.
Input:
The first line contains a single integer ‘T’ representing the n...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.
Count Pairs with Given Sum
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'.
Input:
The first line co...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]) ...
What people are saying about Nagarro
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 pos...
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
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:
...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.
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 construct...
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.
String Rotation Problem Statement
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, starti...
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 'ngcod...
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' representing...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.
Median of Two Sorted Arrays
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 me...
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.
Nagarro Software Developer Intern Interview Experiences
6 interviews found
DSA questions of array and strings
(1 Question)
- Q1. DSA on array advanced topics
Interview Preparation Tips
I appeared for an interview in Dec 2021.
(2 Questions)
Round duration - 90 minutes
Round difficulty - Medium
This round contains 40 mcq questions 15 dsa and 25 aptitude.
then there was 5 coding questions.
- Q1.
Check If Binary Representation of a Number is Palindrome
Given an integer
N, determine if its binary representation is a palindrome.Input:
The first line contains a single integer ‘T’ representing the ... - Ans.
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.
- Q2.
Word Break Problem Statement
You are given a list of
Nstrings calledA. Your task is to determine whether you can form a given target string by combining one or more strings fromA.The strings from
Ac... - Ans.
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...
(1 Question)
Round duration - 25 minutes
Round difficulty - Easy
Technical Round
- Q1.
Sort 0 and 1 Problem Statement
Given an integer array
ARRof sizeNcontaining only integers 0 and 1, implement a function to sort this array. The solution should scan the array only once without using an... - Ans.
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.
Interview Preparation Tips
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
Skills evaluated in this interview
Aditya Shukla
Selected
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.
(1 Question)
- Q1. Conceptual questions involving linked list, sorting, and various other general topics.
(2 Questions)
- Q1. Your introduction
- Q2. Normal conversation about various random topics (HR was trying to check my communication ability)
I appeared for an interview in Dec 2020.
(2 Questions)
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.
- Q1.
DFS Traversal Problem Statement
Given an undirected and disconnected graph
G(V, E), whereVis the number of vertices andEis the number of edges, the connections between vertices are provided in the 'GR... - Ans.
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.
- Q2.
Median of Two Sorted Arrays
Given two sorted arrays
AandBof sizesNandM, find the median of the merged array formed by combining arraysAandB. If the total number of elements,N + M, is even, the m... - Ans.
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.
Interview Preparation Tips
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
Skills evaluated in this interview
I appeared for an interview in Oct 2020.
(3 Questions)
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.
- Q1.
String Rotation Problem Statement
You are given a string named
strand an integerD. Your task is to perform both left (anticlockwise) and right (clockwise) rotations on the given string byDunits, start... - Ans.
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'.
- Q2.
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...
- Ans.
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.
- 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... - Ans.
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.
(1 Question)
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.
- Q1.
Maximum Subarray Sum Problem Statement
Given an array
arrof lengthNconsisting of integers, find the sum of the subarray (including empty subarray) with the maximum sum among all subarrays.Explanation...
- Ans.
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.
Interview Preparation Tips
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.
Skills evaluated in this interview
I appeared for an interview in Sep 2020.
(1 Question)
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.
- Q1.
Prime Numbers Identification
Given a positive integer
N, your task is to identify all prime numbers less than or equal toN.Explanation:
A prime number is a natural number greater than 1 that has no po...
- Ans.
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
(1 Question)
Round duration - 20 minutes
Round difficulty - Medium
First I was asked about my projects and then 2 questions on array were given.
- Q1.
Count Pairs with Given Sum
Given an integer array/list
arrand an integer 'Sum', determine the total number of unique pairs in the array whose elements sum up to the given 'Sum'.Input:
The first line c... - Ans.
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...
Interview Preparation Tips
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.
Skills evaluated in this interview
Interview questions from similar companies
Software Engineer Interview Questions & Answers
Virtusa Consulting Services
Anonymous
posted on 7 May 2022
I applied via Campus Placement and was interviewed before May 2021. There were 2 interview rounds.
Basic aptitude knowledge
Strong in java
Interview Preparation Tips
Software Developer Interview Questions & Answers
Virtusa Consulting Services
Anonymous
posted on 15 Sep 2021
I appeared for an interview before Sep 2020.
(2 Questions)
Round duration - 90 minutes
Round difficulty - Easy
It happens in very friendly manner.
- Q1.
Paths in a Matrix Problem Statement
Given an 'M x N' matrix, print all the possible paths from the top-left corner to the bottom-right corner. You can only move either right (from (i,j) to (i,j+1)) or dow...
- Ans.
Print all possible paths from top-left to bottom-right in a matrix by moving only right or down.
Use backtracking to explore all possible paths from top-left to bottom-right in the matrix.
At each cell, recursively explore moving right and down until reaching the bottom-right corner.
Keep track of the current path and add it to the result when reaching the destination.
- Q2. Can you create 2 tables in SQL and perform different operations on them?
- Ans.
Yes, I can create 2 tables in SQL and perform operations like INSERT, SELECT, UPDATE, and DELETE.
Create Table 1: CREATE TABLE employees (id INT, name VARCHAR(50), salary DECIMAL(10,2));
Create Table 2: CREATE TABLE departments (dept_id INT, dept_name VARCHAR(50));
Insert Data: INSERT INTO employees VALUES (1, 'John Doe', 50000);
Select Data: SELECT * FROM employees WHERE salary > 40000;
Update Data: UPDATE employees SET...
Round duration - 90 minutes
Round difficulty - Medium
No problem occur very friendly environment.
(1 Question)
Round duration - 90 minutes
Round difficulty - Hard
- Q1.
Rat in a Maze Problem Statement
You need to determine all possible paths for a rat starting at position (0, 0) in a square maze to reach its destination at (N-1, N-1). The maze is represented as an N*N ma...
- Ans.
Find all possible paths for a rat in a maze from source to destination.
Use backtracking to explore all possible paths in the maze.
Keep track of visited cells to avoid revisiting them.
Explore all possible directions (up, down, left, right) from each cell.
Add the current direction to the path and recursively explore further.
If the destination is reached, add the path to the list of valid paths.
Interview Preparation Tips
Tip 1 : Competitive programming plays a major role when you are appearing for coding rounds as a fresher. In the coding rounds, you won't get direct problems copied from Geeksforgeeks or Leetcode. You would be required to use your logical thinking to go ahead in the process. This is where competitive programming helps.
Tip 2 : Coding rounds are all about Coding + Timing. Most people fail to excel due to the pressure of a timer ticking on your head. So, instead of just solving problems, try to participate in timed contests. This will help you be used to the pressure of the timer.
Tip 3 : Many big companies like Microsoft, Amazon, and even Google expect you to be good at standard problems. So, once you are done with coding round by your logical skills and competitive programming, you must be well versed with some standard problems in order to excel.
Application resume tips for other job seekersTip 1 : Make it short, crisp, and simple. It is always good to have a 1 pager resume.
Tip 2 : Resume must comprise of the following: Educational Qualifications, Technical skills, Projects, Work experience (if any), Achievements. Other than this, you may include some extra co-curricular achievements.
Skills evaluated in this interview
NIDHI PRIYADARSHINI
Interview Questionnaire
6 Questions
- Q1. Tell me about your project
- Ans.
Developed a web-based project management tool for a startup
Used React for the frontend and Node.js for the backend
Implemented user authentication and authorization using JWT
Integrated with third-party APIs such as Trello and Slack
Implemented real-time updates using WebSockets
Deployed on AWS using EC2 and RDS
- Q2. Write the idea or algorithm for d program of fibonacci series
- Q3. One question from your subject
- Q4. Introduce yourself
- Ans.
I am a software engineer with experience in developing web applications and mobile apps.
Proficient in programming languages such as Java, Python, and JavaScript
Skilled in using frameworks like React, Angular, and Spring Boot
Experienced in working with databases such as MySQL and MongoDB
Familiar with Agile development methodologies and DevOps practices
- Q5. If I give you a box full of pencils..in how many ways can you use it
- Q6. Do you have any question for me
Interview Preparation Tips
Experience: Time management is very important to clear the aptitude test. Besides this a lot of practice is also very important. This round is the major filteration round. Though each round is a major filteration round cuz NTT DATA is not a bulk recruiter like cts, infy etc. Almost 2-3 thousand students were there for this round from 6 different colleges and only 100 of them were selected.
Tips: Its better to start with the preparation from before and do consider the previous year placement papers available at indiabix. You can practice more n more. Apart from this you can go through the r.s aggarwal aptitude book also.
Round: Group Discussion
Experience: There were many panels and each panel had 10-12 students. The H.r first decided some other topic but when he asked wether everybody is aware of the topic ..there were few who didn't know about it. .so he picked up another topic. Fortunately he asked me to start with the discussion. Always try to be the one to break the ice.
Tips: The only key to crack this round is that yku should talk. You should definitely not confuse gd with debate. You should not argue or by any chance shouldn't sound arrogant.
Round: Technical Interview
Experience: They will definitely ask about your project so be thorough with that. Ntt data is a Japanese company . Though this is IT but it will ask from the subject of your own choice from people those who have a non IT background. After you get shortlisted in d gd they will give you a form to fill. Do fill that form without fail. If it is blank then even if u go to the hr round he will reject you.
Tips: Just be confident and always smile. Be careful on what you write in your resume cuz they can ask about anything based on your resume.
Round: HR Interview
Experience: This round was a cake walk. Just be confident and updated about the company. Do ask him a question if he asks you to do that.but make sure it shouldn't be vague or out of the picture.
Tips: Keep smiling and don't get nervous. If they ask you about location preferences, dun get firm at one place.try to be flexible.
General Tips: Donot loose hope at any cost. You never know when your moment is going to arrive. Do practice the aptitude as much as you can. Finally NTT DATA selected only 50 overall in wch 11 were from my college n i was lucky to be one of them. the offer letter was issued the same day and we were all venerated. Its just a game of confidence. All the best
Skill Tips: Try to add some co curricular activities and justify your role.
Skills: communication, technical knowledge, management skills, leadership
College Name: SATHYABAMA UNIVERSITY
Motivation: You will find the it companies mostly head quartered in U.S but this company is in Japan. Plus you have better opportunity and growth compared to other companies cuz its not a bulk recruiter.
Skills evaluated in this interview
kalyan yashwanth
Interview Questionnaire
2 Questions
- Q1. Java ( socket programming, OOPS, DS )
- Q2. Write about your dream
- Ans.
My dream is to build innovative software solutions that positively impact people's lives.
Developing cutting-edge technology
Creating user-friendly interfaces
Solving complex problems
Collaborating with talented individuals
Making a difference in society
Continuous learning and growth
Interview Preparation Tips
Experience: GRE givers , you can make it through this. Brush up your technical skills for the programming section.
Tips: GRE quant and verbal and quick review from tutorialspoint.com would do the trick.
Round: Group Discussion
Experience: I had fun. I won a few debate competitions in various technical symposiums so, It gave a good experience about being quiet at the right moment.
Tips: Turn to your GRAB-ON mode. Never miss any chance. Learn to know when to be quiet and when to talk in a GD. Try to bring down the heat If two participants are getting into a argumentative discussion.
Round: Stress Interview
Experience: It was really difficult. Exactly after the GD, we were asked to right an essay in a very less time and our capability to manage the stress was observed.
Tips: Be calm and write all that you know in a presentable way.
Round: Technical Interview
Experience: I did a project in my 3rd year which included few concepts on Socket programming which helped me a bit in this round. I answered confidently and I was put to a confidence test too to see how sure I was about the answer.
Tips: A quick review on the day of interview and involving in friendly discussion about programming languages before the test helps.
Round: HR Interview
Experience: I was asked few technical questions in this round and later moved on to the general logical questions. Questions like, cutting a bread into multiple slices, finding the corresponding switch among 3 switches for 3 bulbs in room were asked. Find the sum of 1-10 in 4 seconds was asked suddenly. Thanks to Arithmetic Progressions :P.
Tips: Use your logical ability to answer.
Skills: Java, C, Body Language, Mental ability, Confidence.
College Name: Malla Reddy Institute of Engineering & Technology ( MRIET )
Motivation: Ranked among the top 50 of the Fortune 500. Expanding organizations which include lot of opportunities.
Nagarro Interview FAQs
Tell us how to improve this page.
Nagarro Interviews By Designations
- Nagarro Senior Engineer Interview Questions
- Nagarro Staff Engineer Interview Questions
- Nagarro Software Developer Interview Questions
- Nagarro Associate Staff Engineer Interview Questions
- Nagarro Senior Software Engineer Interview Questions
- Nagarro Associate Engineer Interview Questions
- Nagarro Software Engineer Interview Questions
- Nagarro Associate Software Engineer Interview Questions
- Show more
Interview Questions for Popular Designations
- Software Developer Interview Questions
- Software Engineer Interview Questions
- Java Developer Interview Questions
- Front end Developer Interview Questions
- Web Developer Interview Questions
- Senior Software Developer Interview Questions
- Salesforce Developer Interview Questions
- Software Development Engineer Interview Questions
- Show more
Overall Interview Experience Rating
based on 2 interview experiences
Difficulty level
Duration
Interview Questions from Similar Companies
Nagarro Software Developer Intern Reviews and Ratings
based on 2 reviews
Rating in categories
|
Associate Staff Engineer
3.3k
salaries
|  ₹10 L/yr - ₹36 L/yr |
|
Staff Engineer
3.3k
salaries
| ₹11.8 L/yr - ₹45 L/yr |
|
Senior Engineer
2.6k
salaries
| ₹6.3 L/yr - ₹23.6 L/yr |
|
Senior Software Engineer
1.2k
salaries
| ₹7.1 L/yr - ₹27.8 L/yr |
|
Software Engineer
1.1k
salaries
| ₹3.3 L/yr - ₹13 L/yr |
Deloitte
Cognizant
TCS
Accenture
- Home >
- Interviews >
- Nagarro Interview Questions
