Open In App

# Nagarro Interview Experience of Trainee Technology for 2020 batch

Round 1:  The First round was the online test consisting of 40 MCQs from aptitude and 20 MCQs were from the data structure. For correct ans you will get +2.5 and wrong ans there is -1 mark.

In aptitude questions were of series, analogy, profit loss, and all and in the data structure, most questions were based on the complexity of algorithm (as quick, merge, heap sort).

I did 12 questions of aptitude and all DS questions and cleared this test and I gave a test in the morning and in the evening I received the email for interview invite and duration of between test and interview was approx 7 days.

Round 2:  For this round they invited me on their own office, Gurgaon. There gave the three coding questions.

Question-level was as one is easy, one medium, and other difficult. My questions were

1.rotateSubmatrix(submatrix[][], start row index, start column index);

explanation: rotate the submatrix of given matrix clockwise 90degree.

Hint:refer geeksforgeeks

for this, you just have the knowledge of matrix rotation clockwise 90 degrees and you can easily solve this.

2.findPair(int a1[], int a2[], int sum);

explanation: find out the pair of elements which are near to the given sum. This means the difference between the sum of elements of the pair and the given sum should be minimum.

Algorithm:

initialize d=INTEGER.MAXLENGTH, i, j, sum1=0, p1, p2;

for i=0 to <a1.length

sum1=0;

for j=0 to <a2.length

sum1+=a1[i]+a2[j];

difference=sum1-sum ;

if(difference<d) //as diff should be min

{d=difference;  //update difference

p1=a1[i];p2=a2[j]; //update pair value element

3.printFrequency(String str);

explanation: you have a string means like- “hello how are you miss” and you need to print frequency of each word like hello=1, how=1, are=1, you=1, miss=1;

Hint: Use the hashMap technique

algorithm:

char ar[]=str.split(“//”)//split string by space and add into array

HashMap<String, Integer> hp=new HashMap<String, Integer>();

for loop  0 to <ar.length

if hashmap does not contains a string (word) then enter that word into hashmap as key and put its value as 1;

else

increase the value of a particular key which is already present in the hash map (increase the frequency if word again occurred in the array);

as you should write code for the given problem, but you can also write pseudo code as well. I gave the code to all three in Java language.

after waiting 30 min we got result and they selected some girls for TR.

Round 3: In technical round they majorly focus on the code that you have written in your second round.

as for me:

sir asked me firstly that tell me the complexity of your program (the second question as I have described above). my answer was O(n1*n2)where n1=length of the first array, n2 =length of the second array.

then he asked is there any way to optimize this solution, then I said sir I think this is the best way to solve this question, according to me as at that time I could not click another solution. But you can suggest them as dynamic solutions.

after that my next question solution was quite simple (the third question as above) using HashMap (complexity O(1))and about that he didn’t ask me more and after this next question of a rotation matrix, about that he discussed much more…

note: They majorly focus on your approach to solve the problem in min time, as possible.

approx after 20 min my TR became over.

and after 10 min ma’am called me and give me two forms to be filled because I passed my TR.

note: these forms having your basic info about 10, 12th education, and rating your programming, so, fill these forms honestly because HR will ask questions to you based on your this form info.

after  30 to 45 min they called me for an HR round, he was very friendly.

HR question

1. Tell me something about yourself in brief?

2. In which language did you code in your coding round?

3. From which university you are graduating?

4. What is aktu rank?

5. Which rating will you give yourself at your own class level?

6. Are you placed anywhere?

7. Did you visit nagarro site?

8. How many rejections did you get? (i said one )

9. What was wrong in your first rejection?

10. When will you join?

11. Do you want to ask any questions? (i asked one question).

then he said ok then a result, we will mail you after 10 days I got congratulation mail.

For my first and second and TR, I prepared only from GeeksforGeeks. A special thanks go to this site and overall experience was very good.