i
Nagarro
Filter interviews by
Program to sort an array of strings in alphabetical order
Use a sorting algorithm like bubble sort or quicksort
Compare adjacent strings and swap if necessary
Repeat until the array is sorted
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
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)
Space complexity of linked list traversal is O(1) and time complexity is O(n)
Space complexity is constant as we only need a few extra pointers to traverse the list
Time complexity is linear as we need to visit each node in the list once
Example: Traversing a singly linked list from head to tail requires O(n) time complexity
What people are saying about Nagarro
Implement Stacks and Queues using arrays
For implementing a Stack, use an array and keep track of the top element
For implementing a Queue, use an array and maintain front and rear pointers
Example: Implementing a Stack using an array - push elements onto the top and pop elements from the top
Example: Implementing a Queue using an array - enqueue elements at the rear and dequeue elements from the front
Reverse a string in Java using StringBuilder
Create a StringBuilder object with the input string
Use the reverse() method of StringBuilder to reverse the string
Convert the StringBuilder object back to a string using toString()
Use quickselect algorithm to find the Kth smallest element in an array.
Implement quickselect algorithm to efficiently find the Kth smallest element.
Partition the array around a pivot element and recursively search in the appropriate partition.
Time complexity of quickselect is O(n) on average, making it efficient for finding Kth smallest element.
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
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
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, automat...
I applied via Campus Placement
It was regarding Java, English etc.
Program to sort an array of strings in alphabetical order
Use a sorting algorithm like bubble sort or quicksort
Compare adjacent strings and swap if necessary
Repeat until the array is sorted
I am a dedicated and detail-oriented engineer with a passion for problem-solving and continuous learning.
Graduated with a degree in Engineering from XYZ University
Completed internships at ABC Company and gained hands-on experience in project management
Proficient in CAD software and technical drawing
Strong communication skills and ability to work well in a team
First there was a mcq round of basic computer science questions. Then there was a coding round comprising of 5 questions easy to medium level.
Use quickselect algorithm to find the Kth smallest element in an array.
Implement quickselect algorithm to efficiently find the Kth smallest element.
Partition the array around a pivot element and recursively search in the appropriate partition.
Time complexity of quickselect is O(n) on average, making it efficient for finding Kth smallest element.
Question from array and string
Normal Apptitude round
Asked me about .net , c#, sql queries, html ,css and about personal projects as well.
Medium difficulty level.
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
Question based on Arrays, Linked List and Tress
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...
Some basic MCQ questions related to CSE
I applied via Naukri.com and was interviewed before Aug 2023. There were 4 interview rounds.
Aptitude test questions
Question on arrays, linkedlist, strings on medium level
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)
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
Some of the top questions asked at the Nagarro Associate Engineer interview -
The duration of Nagarro Associate Engineer interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 23 interview experiences
Difficulty level
Duration
based on 194 reviews
Rating in categories
Staff Engineer
3.3k
salaries
| ₹22.5 L/yr - ₹38 L/yr |
Associate Staff Engineer
3.3k
salaries
| ₹17 L/yr - ₹31 L/yr |
Senior Engineer
2.5k
salaries
| ₹6.3 L/yr - ₹19.9 L/yr |
Senior Software Engineer
1.3k
salaries
| ₹8.1 L/yr - ₹29.5 L/yr |
Software Engineer
1.1k
salaries
| ₹4.9 L/yr - ₹12.3 L/yr |
Deloitte
Cognizant
TCS
Accenture