Nagarro Technology Trainee Interview Questions, Process, and Tips

2 Coding cased on String, Math, and several DS, ALGO, and Aptitude Questions

Q1. Implement DeQueue, OOPs related Questions.
Add your answer
Q2. Implement DeQueue from scratch
Ans. 
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
Answered by AI
Add your answer
Q3. What is polymorphism?
Ans. 
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.
Answered by AI
Add your answer
Q4. What is inheritance?
Ans. 
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
Answered by AI
Add your answer
Q5. Give real-life examples and code it.
Ans. 
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
Answered by AI
Add your answer

Round duration - 150 Minutes
Round difficulty - Medium

MCQ round was from 10 to 11 .
Coding round was from 11 to 12:30

Q1. 
Segregate Odd-Even Problem Statement
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...read more
Ans. 
Iterate through the array
Used two arraylist to store odd and even separately
add odd and even back to array
Answered Anonymously
Add your answer
Q2. 
Count Derangements Problem Statement
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 ...read more
Ans. 
There are n – 1 way for element 0 
Let 0 be placed at index i. There are now two possibilities, depending on whether or not element i is placed at 0 in return. 

i is placed at 0: This case is equivalent to solving the problem for n-2 elements as two elements have just swapped their positions.
i is not placed at 0: This case is equivalent to solving the problem for n-1 elements as now there are n-1 elements, n-1 ...read more
Answered Anonymously
Add your answer
Q3. 
Smallest Window Problem Statement
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.
Input:
The first...read more
Ans. 
First check if the length of the string is less than the length of the given pattern, if yes then “no such window can exist “.
Store the occurrence of characters of the given pattern in a hash_pat[].
we will be using two pointer technique basically
Start matching the characters of pattern with the characters of string i.e. increment count if a character matches.
Check if (count == length of pattern ) this means a window is...read more
Answered Anonymously
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

It was from 3pm to 3:30pm

Q1. 
Trapping Rain Water Problem Statement
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...read more
Ans. 
brute force
For each element in the array, we find the maximum level of water it can trap after the rain, which is equal to the minimum of maximum height of bars on both the sides minus its own height
optimised
Find maximum height of bar from the left end upto an index i in the array left_max.
Find maximum height of bar from the right end upto an index i in the array right_max.
Iterate over the \text{height}height array and
Answered Anonymously
Add your answer

Round duration - 15 minutes
Round difficulty - Easy

It was from 10 am

Mathematics, Logical based, Not much difficult

Multiple questions, around string manipulation, searching and sorting algorithms, patterns based

Q1. Discussion regarding different situation based.
Add your answer
Q2. Memory and runtime efficiency.
Ans. 
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...read more
Answered by AI
Add your answer