i
Nagarro
Filter interviews by
I was interviewed in Aug 2021.
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)
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...
Given start and end times of meetings, find the maximum number of meetings that can be scheduled in a single room.
Sort the meetings based on their end times in ascending order.
Iterate through the sorted meetings and select the ones that do not overlap with the previously selected meetings.
Keep track of the selected meetings and return their indices.
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 ...
The problem involves dividing an array into K subsets with equal sum.
Use backtracking to try all possible combinations of subsets.
Keep track of the sum of elements in each subset and check if they are equal to the target sum.
Optimize by sorting the array in descending order and assigning elements to subsets greedily.
Handle edge cases like when the sum of elements is not divisible by K.
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 ...
Merge k sorted linked lists into one single sorted linked list.
Create a min-heap to store the heads of all linked lists.
Pop the smallest element from the heap and add it to the result list.
If the popped element has a next element, push it back to the heap.
Repeat until all elements are merged into a single sorted 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 ...
Sort a doubly linked list where each node's position deviates at most K positions from its position in the sorted list.
Iterate through the doubly linked list and maintain a min-heap of size K+1 to keep track of the next smallest element.
Remove the smallest element from the heap and add it to the sorted list. Update the heap with the next element from the removed node's next position.
Continue this process until all node
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...
Find root values of duplicate subtrees in a binary tree.
Traverse the tree in a bottom-up manner to identify duplicate subtrees.
Use a hashmap to store the subtree structures and their frequencies.
Return the root values of duplicate subtrees based on hashmap entries.
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.
Keys in database management systems are unique identifiers for rows in a table.
Keys ensure data integrity by enforcing uniqueness and relationships between tables.
Primary key uniquely identifies each record in a table (e.g. employee ID).
Foreign key establishes a link between two tables by referencing the primary key of another table.
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.
Tip 1 : Do at least 2-3 Development Projects as it creates a great impression.
Tip 2 : Do it simply don't include complex terms to explain anything/concept.
Tip 3 : Practice as many questions as you can.
Tip 1 : Resume should be one page only as being a fresher impact a lot.
Tip 2 : Resumes should contain all the links for projects and certificates as it impresses the interviewer.
Top trending discussions
I applied via Campus Placement and was interviewed in Mar 2024. There were 2 interview rounds.
Linked list and trees
ArrayList is a dynamic array in Java that can grow or shrink in size as needed.
ArrayList is a class in Java that implements the List interface.
It allows for dynamic resizing of the array, unlike regular arrays.
Elements can be added, removed, or accessed by index.
Example: ArrayList
Object-oriented programming concepts focus on creating objects that interact with each other to accomplish tasks.
Encapsulation: Bundling data and methods that operate on the data into a single unit (object)
Inheritance: Allowing a class to inherit properties and behavior from another class
Polymorphism: Objects of different classes can be treated as objects of a common superclass
Abstraction: Hiding complex implementation
I have written a project code for a web application that tracks user activity and generates reports.
Used HTML, CSS, and JavaScript for front-end development
Utilized PHP and MySQL for back-end development
Implemented user authentication and data visualization features
I applied via LinkedIn and was interviewed before Feb 2023. There were 2 interview rounds.
THEY ASKED APTITUDE ENGLISH AND TECHNICAL QUESTIONS
2 question of arrays.
I applied via LinkedIn and was interviewed in Jul 2024. There were 4 interview rounds.
Aptitude test is to easy
Coding test easy too good
I was interviewed in Apr 2022.
Round duration - 180 minutes
Round difficulty - Hard
There was 1 round of 180 minutes which contains of 3 questions from DSA. the two question was of medium level but one question is of neither difficult nor medium level question based on tree
Given an array of integers with 'N' elements, determine the length of the longest subsequence where each element is greater than the previous element. This...
Find the length of the longest strictly increasing subsequence in an array of integers.
Use dynamic programming to keep track of the longest increasing subsequence ending at each element.
Initialize an array to store the length of the longest increasing subsequence ending at each index.
Iterate through the array and update the length of the longest increasing subsequence for each element.
Return the maximum value in the ar...
Check whether a given graph is bipartite or not. Return true
if the graph's vertices can be divided into two independent sets, ‘U’ and ‘V’, such that every edge (‘u’, ‘v’) either c...
Check if a given graph is bipartite by dividing vertices into two independent sets.
Use BFS or DFS to traverse the graph and assign colors to vertices to check for bipartiteness.
If an edge connects vertices of the same color, the graph is not bipartite.
Return true if all edges connect vertices of different colors, else return false.
Given an integer array ARR
of size N
containing all distinct values, determine the total number of inversions present in the array.
An inversion is defined for a pair o...
Count the total number of inversions in an integer array.
Iterate through the array and for each pair of elements, check if the conditions for inversion are met.
Use a nested loop to compare each element with all elements to its right.
Keep a count of the inversions found and return the total count at the end.
Round duration - 50 minutes
Round difficulty - Medium
In interview I was asked about some question related to Data structures , DBMS . Some output based question was asked and 2 coding problems was given to solve.
Given an integer array 'ARR' of size 'N' and an integer 'K', return all the subsets of 'ARR' which sum to 'K'.
A subset of an array 'ARR' is a tupl...
Given an array and an integer, return all subsets that sum to the given integer.
Use backtracking to generate all possible subsets of the array.
For each subset, check if the sum equals the given integer 'K'.
Print the subsets that satisfy the condition.
Example: For input [1, 2, 3] and K=3, subsets [1, 2] and [3] have sum 3.
Given a binary tree of integers, your task is to print the boundary nodes of the binary tree in an anti-clockwise direction starting from the root node.
The boundary...
Boundary traversal of a binary tree in anti-clockwise direction starting from the root node.
Implement a function to calculate the boundary traversal of a binary tree
Include nodes from left boundary, leaf nodes, and right boundary in sequence
Ensure only unique nodes are included in the output
Print the boundary nodes separated by single spaces for each test case
Tip 1 - Practice At least 250 Questions of DS algo
Tip 2 - Do at least 2 application based projects
Tip 3 - Practice questions with optimized approaches
Tip 1 : Have some application based projects on resume.
Tip 2 : Do not put false things on resume.
Tip 3 : Project should clear and crisp
I applied via LinkedIn and was interviewed in Apr 2024. There was 1 interview round.
Learn about techstack
It is easy for me . they asked questions related to logical reasoning, verbal, abstract reasoning and networking. all the questions are mcq based questions.
Coding round was soo easy they asked one string related and another question is related to array
based on 1 interview
Interview experience
Associate Staff Engineer
2.9k
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.1k
salaries
| ₹0 L/yr - ₹0 L/yr |
Engineer
901
salaries
| ₹0 L/yr - ₹0 L/yr |
Deloitte
Cognizant
TCS
Accenture