Nagarro Trainee Interview Questions, Process, and Tips

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

Simple Aptitude Questions

3 coding questions, easy to medium difficulty

Q1. Basic Oops questions
Add your answer

Q1. Intro and why you want to join.
Add your answer

40 question asked 25 questions from aptitude and 15 questions from data structure and some from computer fundamental's, questions are easy to medium.

3 Coding questions were asked in Coding round
First question from String
Second question from Array
3rd from Dynamic Programming

Q1. One coding question were asked Find missing and duplicate numbers from N Natural numbers array
Ans. 
Find missing and duplicate numbers from N Natural numbers array
• Iterate through the array and keep track of seen numbers using a hash set

• For each number, check if it is already in the hash set. If yes, it is a duplicate. If not, add it to the set

• After iterating through the array, the missing numbers are the ones not in the hash set

• Alternatively, sort the array and check for duplicates and missing numbers
Answered by AI
View 1 more 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

MCQs type questions in first round

2 section for coding round with 3questions in first and 2 in second