Nagarro Associate Engineer Interview Questions, Process, and Tips

60 min in 50 questions

90 mintues in 3 coding average level question

Q1. As per profile which u selected or applied
Add your answer
Q2. Development and automation testing basics
Add your answer

Q1. Normal HR questions
Add your answer

There were multiple aptitude questions including small coding questions.

Q1. Write a program for calculator
Ans. 
A simple calculator program that can perform basic arithmetic operations
• Create functions for addition, subtraction, multiplication, and division

• Take user input for numbers and operation choice

• Display the result of the operation
Answered by AI
Add your answer

Q1. Tell me about yourself?
Add your answer
Q2. Why you want to work here.
Add your answer
Q3. What do you know about the company?
Add your answer

Some apti + techical mcqs easily available on internet

5 coding ques were there those who completed 3 fully correct were selected.

Q1. Remove a linked list node without head or tail pointer given
Ans. 
Removing a node from a linked list without head or tail pointer
• Use the node to be removed's next node to copy its data and then delete the next node

• Update the current node's next pointer to skip the next node
Answered by AI
Add your answer
Q2. Remove nth element from array
Ans. 
Remove the nth element from an array of strings
• Use the splice method to remove the element at the specified index

• Remember that array indices start at 0

• Example: array.splice(n, 1) will remove the element at index n
Answered by AI
Add your answer
Q3. 1 riddle I forgot
Add your answer
Q4. Quick and merge time complexity and when worst case happens in quick sort
Ans. 
Quick sort has O(n log n) time complexity on average, O(n^2) worst case. Merge sort has O(n log n) time complexity always.
• Quick sort has an average time complexity of O(n log n) due to its divide-and-conquer approach.

• Worst case for quick sort occurs when the pivot element is either the smallest or largest element in the array, leading to O(n^2) time complexity.

• Merge sort always has a time complexity of O(n log n) due t...read more
Answered by AI
Add your answer

Q1. Interview started with my introduction
Add your answer
Q2. Explain you previous experience
Add your answer
Q3. Do you have any existing offer and if yes then why this company
Add your answer
Q4. Your favorite programming language and why
Ans. 
My favorite programming language is Python because of its simplicity, readability, and versatility.
• Python is known for its clean and readable syntax, making it easy to learn and understand.

• Python has a large standard library and many third-party libraries, allowing for rapid development of a wide range of applications.

• Python is versatile and can be used for web development, data analysis, machine learning, automation,
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

2 coding questions 
Afternoon test 
Proctored

Q1. 
Trailing Zeros in Factorial Problem
Find the number of trailing zeroes in the factorial of a given number N.
Input:
The first line contains an integer T representing the number of test cases.
Each of the...read more
Ans. 
Count the number of trailing zeros in the factorial of a given number.
• To find the number of trailing zeros in N!, count the number of factors of 5 in the prime factorization of N.

• Each factor of 5 contributes to a trailing zero in the factorial.

• For example, for N=10, there are 2 factors of 5 in the prime factorization (5 and 10), so there are 2 trailing zeros.
Answered by AI
Add your answer
Q2. 
Count Ways To Reach The N-th Stair Problem Statement
You are given a number of stairs, N. Starting at the 0th stair, you need to reach the Nth stair. Each time you can either climb one step or two steps. ...read more
Ans. 
The problem involves finding the number of distinct ways to climb to the Nth stair by taking one or two steps at a time.
• Use dynamic programming to solve this problem efficiently.

• The number of ways to reach the Nth stair is the sum of the number of ways to reach the (N-1)th stair and the (N-2)th stair.

• Handle large inputs by taking modulo 10^9+7 to avoid overflow.

• Example: For N=3, there are 3 ways to climb to the third s
Answered by AI
Add your answer

Round duration - 30 mins
Round difficulty - Medium

Afternoon interview 
I was asked OOPS, OS, DBMS, DS and Algo questions. 
Questions around my project 
Questions around my internships

Round duration - 15 mins
Round difficulty - Easy

Just after interview, HR asked general questions like whether I am a team player etc

Q1. Where do you see yourself in five years?
Add your answer