Nagarro Associate Engineer Interview Questions, Process, and Tips

Question from array and string

Normal Apptitude round

Asked me about .net , c#, sql queries, html ,css and about personal projects as well.

Q1. Salary Expectation
Add your answer

Medium difficulty level.

Q1. Oops concept coding questions
Add your answer
Q2. What is multi threading?
Ans. 
Multi threading is a programming concept where multiple threads within a process execute independently to improve performance.
• Allows for concurrent execution of tasks within a single process

• Improves performance by utilizing multiple CPU cores

• Requires careful synchronization to avoid race conditions

• Examples include web servers handling multiple requests simultaneously
Answered by AI
Add your answer

Q1. 5 qualities that define you.
Add your answer

Question based on Arrays, Linked List and Tress

Q1. Which Programming language will you prefer HashMap and internal working of HashMap String pool loop in a Linked list Oops Concept real type of problem
Ans. 
I would prefer Java for its versatility and widespread use in software development.
• Java is a popular programming language known for its flexibility and scalability.

• HashMap is a data structure in Java that stores key-value pairs and uses hashing to efficiently retrieve values.

• String pool in Java is a pool of unique string literals stored in memory to optimize memory usage.

• Looping through a Linked List involves iterating...read more
Answered by AI
Add your answer

Q1. Introduction will ask question from your resume Strength and weakness
Add your answer

Some basic MCQ questions related to CSE

Q1. Coding question and technical questions
Add your answer

Aptitude test questions

Question on arrays, linkedlist, strings on medium level

Q1. Find loop on linkedin list
Ans. 
To find a loop in a linked list, use Floyd's Cycle Detection Algorithm.
• Use two pointers, slow and fast, to traverse the linked list.

• If there is a loop, the fast pointer will eventually meet the slow pointer.

• Example: 1->2->3->4->5->2 (loop back to 2)
Answered by AI
Add your answer
Q2. How to find largest element in array with O(N) complexity
Ans. 
Iterate through array once, keeping track of largest element found so far.
• Initialize a variable to store the largest element found so far

• Iterate through the array and update the variable if a larger element is found

• Return the largest element after the iteration is complete
Answered by AI
Add your answer

Q1. Question on project and internship
Add your answer
Q2. Introduction and educational qualification and hobbies.
Add your answer