i
Nagarro
Filter interviews by
Clear (1)
I applied via Company Website and was interviewed before Aug 2022. There were 2 interview rounds.
2 Coding cased on String, Math, and several DS, ALGO, and Aptitude Questions
Implement DeQueue using arrays in a programming language
Create an array to store the elements of the DeQueue
Implement functions to add elements at both ends of the DeQueue
Implement functions to remove elements from both ends of the DeQueue
Ensure proper handling of empty DeQueue and full DeQueue scenarios
Polymorphism is the ability of a single function or method to operate on different types of data.
Polymorphism allows objects of different classes to be treated as objects of a common superclass.
It enables a single interface to be used for different data types.
Examples include method overloading and method overriding in object-oriented programming.
Inheritance is a concept in object-oriented programming where a class can inherit attributes and methods from another class.
Allows for code reusability and promotes the concept of hierarchical classification
Derived class inherits properties and behaviors of the base class
Types of inheritance include single, multiple, multilevel, and hierarchical inheritance
Real-life examples and code for Technology Trainee interview question.
Example 1: Creating a simple calculator app in Python
Example 2: Implementing a basic chatbot using JavaScript
Example 3: Developing a website using HTML, CSS, and JavaScript
I was interviewed in May 2021.
Round duration - 150 Minutes
Round difficulty - Medium
MCQ round was from 10 to 11 .
Coding round was from 11 to 12:30
In a wedding ceremony at NinjaLand, attendees are divided into two groups: bride’s side and groom’s side. Attendees from the bride’s side hold odd numbers, while those...
Rearrange attendees from bride's side and groom's side while maintaining original order within each group.
Iterate through the linked list and separate odd and even numbers into two separate lists.
Merge the two lists while maintaining the original order within each group.
Output the rearranged linked list with bride's side attendees followed by groom's side attendees.
You are tasked with finding the total number of derangements for a given set of elements. Specifically, for an integer N
, determine how many ways there are to permute ...
The task is to find the total number of derangements for a given set of elements, where no element appears in its original position.
Implement a function to calculate the number of derangements for a given set size 'N'.
Ensure to calculate the output as 'answer % (10^9 + 7)' due to large numbers.
Consider the constraints of 1 <= T <= 5 and 1 <= N <= 5000.
Provide the output for each test case on a new line.
Given two strings S
and X
containing random characters, the task is to find the smallest substring in S
which contains all the characters present in X
.
The first...
The task is to find the smallest substring in string S which contains all the characters present in string X.
Iterate through string S and keep track of characters in X using a hashmap
Use two pointers to maintain a sliding window containing all characters in X
Update the window size and result as you iterate through S
Round duration - 30 minutes
Round difficulty - Easy
It was from 3pm to 3:30pm
You are given a long type array/list ARR
of size N
, representing an elevation map. The value ARR[i]
denotes the elevation of the ith
bar. Your task is to determine th...
Calculate the total amount of rainwater that can be trapped between given elevations in an array.
Iterate through the array and calculate the maximum height on the left and right of each bar.
Calculate the amount of water that can be trapped at each bar by finding the minimum of the maximum heights on the left and right.
Sum up the trapped water at each bar to get the total trapped water for the entire array.
Round duration - 15 minutes
Round difficulty - Easy
It was from 10 am
Tip 1 : Practice array,strings and recursion well.
Tip 2 : Have atleast 2 projects.
Tip 1 : Keep Resume clean.
Tip 2 : Mention only project/technologies that you are comfortable with.
I applied via Campus Placement and was interviewed before Apr 2022. There were 4 interview rounds.
Mathematics, Logical based, Not much difficult
Multiple questions, around string manipulation, searching and sorting algorithms, patterns based
Memory and runtime efficiency are crucial for optimal performance of any technology.
Efficient algorithms and data structures can improve memory and runtime efficiency.
Caching and memoization can reduce runtime by storing frequently used data.
Optimizing code and reducing unnecessary computations can improve both memory and runtime efficiency.
Using appropriate programming languages and frameworks can also impact efficien...
I applied via Company Website and was interviewed in Apr 2021. There was 1 interview round.
Hashmap search has constant time complexity O(1) due to its use of hash function and index-based storage.
Hashmap uses a hash function to generate a unique index for each key-value pair
This index is used to directly access the value in the underlying array
As long as the hash function is well-designed and the array is large enough, search time remains constant
Example: searching for a value with key 'John' in a hashmap of...
Nagarro interview questions for designations
Top trending discussions
I applied via Naukri.com and was interviewed in Aug 2020. There were 3 interview rounds.
I applied via Campus Placement and was interviewed before Feb 2020. There were 6 interview rounds.
I applied via Company Website and was interviewed before Feb 2020. There was 1 interview round.
I applied via Campus Placement and was interviewed in Oct 2020. There were 4 interview rounds.
Bubble sort is a simple sorting algorithm that repeatedly steps through the list, compares adjacent elements and swaps them if they are in the wrong order.
Start from the first element and compare it with the next element
If the next element is smaller, swap them
Repeat this process for all elements in the array
Continue this process until no more swaps are needed
A program to print all prime numbers
Take input from user for range of numbers
Loop through the range and check if each number is prime
Print the prime numbers
Hashmap is a data structure that stores key-value pairs and allows constant time access to values based on their keys.
Hashmap uses a hash function to map keys to indices in an array.
Collisions can occur when multiple keys map to the same index, which can be resolved using techniques like chaining or open addressing.
Examples of hashmap implementations include Java's HashMap class and Python's dict type.
Inheritance is a mechanism in object-oriented programming where a new class is created by inheriting properties of an existing class.
Inheritance allows code reuse and promotes code organization.
The existing class is called the parent or superclass, and the new class is called the child or subclass.
The child class inherits all the properties and methods of the parent class and can also add new properties and methods.
For...
I applied via Walk-in and was interviewed in Mar 2021. There was 1 interview round.
I applied via Campus Placement and was interviewed before Dec 2021. There were 2 interview rounds.
Basic logical reasoning and verbal questions . Easy to clear
based on 2 interviews
Interview experience
based on 5 reviews
Rating in categories
Associate Staff Engineer
3k
salaries
| ₹0 L/yr - ₹0 L/yr |
Staff Engineer
2.9k
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Engineer
2.4k
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
1.2k
salaries
| ₹0 L/yr - ₹0 L/yr |
Engineer
909
salaries
| ₹0 L/yr - ₹0 L/yr |
Deloitte
Cognizant
TCS
Accenture