Nagarro Software Engineer Interview Questions
& Process
Real candidates share what happened, how many rounds they had,
and how the experience turned out.
Based on 665 interview experiences · FREE TO READ
Candidate interview experiences
First-hand accounts from people who interviewed at Nagarro.
Nagarro
Software Engineer
Intern Average Positive experience No offer 3 rounds
Interview process
Technical screen Recruiter call
Interview formats
Coding Technical Other
Nagarro had a 3-stage interview process. First, an Online Assessment with 3 coding questions and 25 aptitude MCQs on Java, SQL, and logical reasoning, ranging from basic to moderate difficulty. Then, a 20-minute technical interview if you passed the assessment. They asked for a self-introduction, details about my main project (role and responsibilities), some OOPs questions, and a coding question to merge two sorted arrays, including explaining the code's logic. I didn't make it to the HR round, but the process was really helpful for my skills.
Confirmed questions1 question
- Could you please merge two sorted arrays and also explain the logic behind your code?
Nagarro
Technical Lead
Lead Average Positive experience No offer 2 rounds
Interview process
Recruiter call Technical screen Phone screen
Interview formats
Technical Behavioral
I attended an interview drive for multiple roles. I got there around 1pm, and my interview started about 3.5 hours later, around 4:30pm. Both the HR person and the interviewer were really nice, polite, and always smiling. The interviewer was friendly and didn't make me feel bad if I got an answer wrong. I got through to the second round, but unfortunately, I didn't make it because I lacked experience in distributed systems. It was a good experience overall, and I'd love to join the company if I get another opportunity.
Confirmed questions5 questions
- Can you explain your reasons for choosing Azure Functions?
- What does scalability mean in the context of Azure, and why is it a crucial aspect?
- Could you elaborate on the CAP theorem?
Nagarro
Senior Software Engineer
Senior Difficult Negative experience No offer 1 round
Interview process
Technical screen
Interview formats
Coding Technical
It was a 2 hr screening test with 5 sections. The 1st section had 4 java 11 datastructure programs, and each program took about 20 min to complete, so all the time went there. The 2nd section had 2 database query programs of medium difficulty. The 3rd section involved Java programs where you needed to identify the output and errors. The 4th section was verbal and aptitude, and the 5th section had Java knowledge questions. There were a total of 84 questions. It felt like a waste of time writing it all, and there was no proper result. I wouldn't recommend spending your time on this, better to spend it on other interviews.
Confirmed questions5 questions
- Write 4 Java 11 data structure programs.
- Write 2 database query programs.
- Identify output and errors in Java programs.
Nagarro Software Engineer Interview Questions
Quoted word for word from Nagarro interview reports.
“If an ArrayList is declared as final, can add and remove operations still be performed on the list?”
Read reports →“What is the method to find the second largest element in a list?”
Read reports →“If you have a singly linked list where each node is a character, how would you demonstrate that it's a palindrome?”
Read reports →“Can you write code to find the nth element from the end of a linked list?”
Read reports →“What is the time complexity and how do you find the second largest element in an array?”
Read report →“What are the different types of thread pools that can be created using ExecutorService?”
Read report →“How would you sort an array containing only 1s, 2s, and 0s?”
Read report →“Can communication in microservices be achieved using REST APIs for asynchronous communication, and if so, how?”
Read report →“Can you show me how to multiply two numbers without using the multiplication operator?”
Read report →Formats, difficulty and experience
Across all 665 Nagarro interview reports.