Open in App
Not now

Nagarro Interview Experience | Off-Campus

• Difficulty Level : Expert
• Last Updated : 14 Jan, 2020

Round 1-> It was an online round on mettl. It consists of two parts both have 15 questions. First was basic aptitude round which mostly contains time and work, profit-loss, percentage and ratio, speed and distance and geometry questions. Second part contains data structures and algorithm quiz. These are very straight forward and basic questions like what is time complexity of quick sort in all(best, average and worst) case and why. Which sorting algorithm is used in STL in c++. What is the output of this program etc.

Round 2->It is coding round which contains three problems.
1)An array is given your task is to keep all the negative elements left side and positive elements on right side with time complexity of O(nlogn).
I don’t exactly remember elements of the array but am giving an example just for your reference
Arr[] = {3, -9, 5, -1, 2, 6, 7, -10, -12}
your output should be {-9, -1, -10, -12, 3, 5, 2, 6, 7}

2)Print the following pattern :-
1 2 3 4 5
2 1 2 3 4
3 2 1 2 3
4 3 2 1 2
5 1 2 3 4

3)Two strings are given to you which have some common words now make the First letter of each word capital in first string which is not in second string and rest words will remain same.
Example: string1 = “failure is just practice for success”
string2 = “is practice”
output:- “Failure is Just practice For Success”

Round 3(face to face)-> Since, I have done all the three questions So, interviewer’s expectations were a bit high. He started with a formal introduction and then asked about my approaches like what firstly strikes to your mind when you read the problem statement and I told “time constraint” I have tried some approaches and which took required time I applied that to the solution like in first question I applies merge sort. Then he asked me some other problems and how to optimize it and multiple approaches to solve a problem. Basically he was testing my ability to approach the problem. Then he asked some question of linked list example:- find intersection of two linked list if their order is maintained and if their order is not maintained. Reverse a linked list in K pairs. Which sorting algorithm is best etc. I replied to almost every question of him and he looked quite satisfied my replies.

Round-4(HR Round)-> Give me a quick intro.
What was your rank in JEE(Mains).
Tell me something about your college( Since I was joining as a fresher)
What is your aggregate percentage in B.tech.
Do you have any hackerearth or Codechef profile?
Do you like to participate in competitive challenges?
Are you comfortable to relocate?
What do you know about Nagarro?
What technologies are used in Nagarro?