Nagarro SDE Interview Questions, Process, and Tips

Q1. DSA ARRAY QUESTIONS EASY TO MEDIUM LEVEL
Add your answer

Round duration - 180 minutes
Round difficulty - Medium

It was a long round of around 3 hours divided into 2 parts 
1. Aptitude(MCQ)
2. Coding(Subjective)

Q1. 
Maximum Meetings Selection
You are tasked with scheduling meetings in a single meeting room. Given N meetings, each with a start time Start[i] and end time End[i], determine the maximum number of meetings...read more
Ans. 
1. Sort all pairs(Meetings) in increasing order of the second number(Finish time) of each pair.
2. Select the first meeting of the sorted pair as the first Meeting in the room and push it into the result vector and set a variable time_limit(say) with the second value(Finishing time) of the first selected meeting.
3. Iterate from the second pair to the last pair of the array and if the value of the first element(Starting ...read more
Answered Anonymously
Add your answer
Q2. 
Partition to K Equal Sum Subsets Problem
Given an array of integers and a positive integer 'K', determine if it is possible to divide the array into 'K' non-empty subsets such that the sum of elements in ...read more
Ans. 
1. If K is 1, then we already have our answer, the complete array is only a subset with the same sum. 
2. If N < K, then it is not possible to divide the array into subsets with an equal sum because we can’t divide the array into more than N parts. 
3. If the sum of the array is not divisible by K, then it is not possible to divide the array. We will proceed only if k divides the sum. Our goal reduces to div...read more
Answered Anonymously
Add your answer
Q3. 
Merge k Sorted Linked Lists
You are provided with 'K' sorted linked lists, each sorted in increasing order. Your task is to merge all these lists into one single sorted linked list and return the head of ...read more
Ans. 
A Simple Solution is to initialize the result as the first list. Now traverse all lists starting from the second list. Insert every node of the currently traversed list into the result in a sorted way.
Answered Anonymously
Add your answer
Q4. 
Sort a "K" Sorted Doubly Linked List
Given a doubly-linked list with N nodes, where each node’s position deviates at most K positions from its position in the sorted list, your task is to sort this given ...read more
Ans. 
Sort the given doubly linked list using the insertion sort technique. While inserting each element in the sorted part of the list, there will be at most k swaps to place the element to its correct position since it is at most k steps away from its correct position.
Answered Anonymously
Add your answer
Q5. 
Duplicate Subtrees Problem Statement
Given a binary tree, return the root values of all duplicate subtrees. Two subtrees are considered duplicate if they have the same structure with identical node values...read more
Ans. 
The idea is to use hashing. We store in order traversals of subtrees in a hash. Since simple inorder traversal cannot uniquely identify a tree, we use symbols like ‘(‘ and ‘)’ to represent NULL nodes.
Answered Anonymously
Add your answer

Round duration - 25 minutes
Round difficulty - Medium

The technical Interview round was not at all difficult. The main focus of the interviewer was my projects and development fields.
He also asked some DS/Algo questions that were at a medium level, and some easy questions for database management.

Q1. Can you explain the concept of keys in database management systems?
Add your answer

Round duration - 15 minutes
Round difficulty - Easy

It took place on the same day as the technical round. It was quite the easiest round of all. The interviewer just asked me to introduce myself, projects I have worked on, my Internships experience, and were they internships paid.

Q1. Can you tell me about yourself?
Ans. 
Tip 1 : Be active while introducing yourself.
Tip 2 : in online mode always try to be in the video mode as your expression says a lot
Answered Anonymously
Add your answer
Q2. Can you tell me about the different projects that you have worked on?
Ans. 
Tip 1 : Keep a handful of knowledge of your projects anything can be asked from that
Answered Anonymously
Add your answer