Nagarro Trainee Interview Questions, Process, and Tips for Experienced

Q1. DSA Question about linked list operation
Add your answer

Q1. Simple hr questions like your strength weakness , able to relocate
Add your answer

This round consisted of Aptitude and Computer Fundamental Questions.I don't remember exactly how many but I guess there were around 50 MCQ's. I might solved around 37+ correct questions.

This round consisted of 3 Coding Questions. 1 Easy Medium, 1 Medium and 1 Hard Question.Solved first two and passed only 3 test cases in the third question.

Q1. This round lasted for only 15 minutes and the interviewer asked me Two Sum Problem. Explained from Naive to Most Optimized solution, i.e O(N^2) to O(N).Gave him 3 solutions and the interviewer was satisfie...read more
Add your answer
Q2. Given an array find if there are two elements are present that sum to target, else return -1;
Ans. 
Given an array find if there are two elements are present that sum to target, else return -1
• Iterate through the array and for each element check if target - element is present in the array

• Use a hash table to store the elements and their indices for faster lookup

• If no such pair is found, return -1
Answered by AI
Add your answer

Q1. General HR Questions like Strengths, Weaknesses, About Company and bit about my family background.
Add your answer

The coding round has 3 questions of easy-medium level .

Q1. In what cases quick sort has worst case time complexity
Ans. 
Quick sort has worst case time complexity when the pivot element is either the smallest or largest element in the array.
• Pivot element is the smallest or largest element in the array

• Array is already sorted in ascending or descending order

• Pivot selection strategy is not efficient
Answered by AI
Add your answer
Q2. How can you check whether the give string can become palindrome or not. You can apply unlimited operations.
Ans. 
To check if a string can become a palindrome, count the frequency of each character. If there is at most one character with an odd frequency, it can be rearranged into a palindrome.
• Count the frequency of each character in the string

• Check if there is at most one character with an odd frequency

• If yes, the string can be rearranged into a palindrome
Answered by AI
Add your answer
Q3. How can you find middle element of linkedList in O(n)
Ans. 
Use two pointers, one moving twice as fast as the other, to find the middle element of a linked list in O(n) time complexity.
• Initialize two pointers, slow and fast, at the head of the linked list.

• Move the slow pointer one step at a time and the fast pointer two steps at a time.

• When the fast pointer reaches the end of the list, the slow pointer will be at the middle element.
Answered by AI
Add your answer

Q1. Do you have any other offers , Why you want to join Nagarro?
Add your answer

Basic aptitude questions, time duration within 60 minutes.

Five questions - two easy, three moderate level

Q1. Basic DSA, OOPS concepts, complexities related questions
Add your answer

Q1. About yourself? Why you want to join nagarro? Salary expectation? Location is ok with you?
Add your answer