I am currently in my fourth year of B.Tech. Nagarro visited our campus in 3rd Week of August 2022.
Eligibility:
- Elibile streams are B. Tech (CSE/IT/ECE), M. Tech (CSE) & MCA.
- 60 % in the current degree.
Round 1(Aptitude + Technical MCQ’s) + Coding round:
- Aptitude Test Duration: 60 Minutes(easy to medium).
- Technical MCQs are from OOPS, OS, DBMS, DS, etc.
- Coding Test Duration: 150 Minutes.
- We get 90 mins to solve three questions for the SD role and 60 mins to solve 2 questions for the CSD role.
- Some of the coding questions are:
- https://codeto.win/problem/1024
- https://leetcode.com/problems/two-sum/description/
- https://leetcode.com/problems/delete-and-earn/description/
- https://www.geeksforgeeks.org/maximize-sum-selected-numbers-performing-following-operation/amp/
- One graph-based question.
- Lexicographically smallest string. (prepare strings as well).
- I was able to solve 3 SD questions and 1 CSD question.
- If you can solve 2 SD questions then also you will get selected for the second round.
The next day I got an email that I’m qualified for Round 2 and I have an online technical interview. (around 12/90 students were selected).
Round 2 (Technical Interview): My interview was scheduled for around 9:45 PM. This was my first interview. The interview lasts for 15 minutes. Firstly, he(The interviewer) introduce himself and asked for my introduction.
He asked me my language preference, I usually code in c++.
- Difference between this keyword and Super Keyword.
- Oops, concepts.
- (Detection of the cycle in Linked List) https://www.geeksforgeeks.org/detect-loop-in-a-linked-list/amp/
- Find the element with the highest frequency of an element in an array.
- Delete a node from the end of a Linked List.
- Quick Sort algorithm.
- Rotate a matrix 90 degrees. https://www.geeksforgeeks.org/rotate-a-matrix-by-90-degree-in-clockwise-direction-without-using-any-extra-space/amp/
- Check if a singly linked list is a palindrome. https://www.geeksforgeeks.org/function-to-check-if-a-singly-linked-list-is-palindrome/amp/
- What are stacks and queues?
- The time complexity of Quick sort and why it’s best?
Questions about basic data structures were also asked. Their main focused topic was Linked Lists. I answered all the questions. The next day I got a selection mail for the HR round. 3/12 were selected.
Round 3( HR round):
- Introduction.
- Strength and weakness.
- Why do you think this is your strength/weakness?
- Why do you want to join Nagarro?
- Willing to reallocate.
- Do you have any questions for me?
I got selected for the SD profile.
All the best!