Filter interviews by
I applied via Monster and was interviewed in Sep 2022. There were 3 interview rounds.
Top trending discussions
posted on 14 Jul 2022
I applied via Referral and was interviewed in Jan 2022. There was 1 interview round.
I applied via Referral and was interviewed in Jul 2023. There were 2 interview rounds.
They'll give one vedio and based on that question will be.
I was interviewed in May 2022.
Round duration - 90 minutes
Round difficulty - Easy
It was just after the first round in the morning
Given an array ARR
of integers containing 'N' elements where each element denotes the frequency of a character in a message composed of 'N' alphabets of an alien language, your ta...
Implement a function to generate Huffman codes for characters based on their frequencies in an alien language message.
Use a priority queue to build the Huffman tree efficiently.
Assign '0' and '1' to left and right branches of the tree respectively to generate unique binary codes.
Ensure that each code distinctly identifies its corresponding character and minimizes the total number of bits used for the message.
Round duration - 90 Minutes
Round difficulty - Medium
1 hr after the second round got over and results were announced in the morning.
Given an infinite supply of coins of varying denominations, determine the total number of ways to make change for a specified value using these coins. If it's not possible to make...
The task is to find the total number of ways to make change for a specified value using given denominations.
Create a dynamic programming table to store the number of ways to make change for each value up to the target value.
Iterate through each denomination and update the table accordingly based on the current denomination.
The final answer will be the value in the table at the target value.
Consider edge cases such as w...
Round duration - 90 Minutes
Round difficulty - Medium
10 A.M in the morning.
The interviewers were very knowledgeable and humble
Nobita wants to impress Shizuka by correctly guessing her lucky number. Shizuka provides a sorted list where every number appears twice, except for her lucky number, which a...
Find the unique element in a sorted array where all other elements appear twice.
Iterate through the array and XOR all elements to find the unique element.
Use a hash set to keep track of elements and find the unique one.
Sort the array and check adjacent elements to find the unique one.
Your task is to find all nodes that are exactly a distance K from a given node in an arbitrary binary tree. The distance is defined as the number of edges between ...
Find all nodes at distance K from a given node in a binary tree.
Perform a depth-first search starting from the target node to find nodes at distance K.
Use a recursive function to traverse the tree and keep track of the distance from the target node.
Maintain a set to store visited nodes and avoid revisiting them.
Return the list of nodes found at distance K from the target node.
Example: For the given input tree, target n...
Round duration - 90 Minutes
Round difficulty - Medium
It was after the first technical interview round.
Got a mail for the second interview round .
Timings approx 12 AM
Given a Binary Search Tree (BST) and a specified range [min, max], your task is to remove all keys from the BST that fall outside this range. The BST should remain vali...
Remove keys outside given range from a Binary Search Tree while keeping it valid.
Traverse the BST in inorder and remove nodes outside the specified range
Recursively check left and right subtrees for nodes to remove
Update pointers to maintain the validity of the BST
Return the inorder traversal of the adjusted BST
Given an arbitrary binary tree and a specific node within that tree, determine the inorder successor of this node.
The inorder successor of a node in a bi...
Given a binary tree and a specific node, find its inorder successor in the tree.
Perform an inorder traversal of the binary tree to find the successor node.
If the given node has a right child, the successor is the leftmost node in the right subtree.
If the given node does not have a right child, backtrack to find the ancestor whose left child is the given node.
Round duration - 30 Minutes
Round difficulty - Easy
Got a call from Hr after clearance of the first 2 rounds.
Timing were 5:30 P.M
Tip 1 : Focus the most on Data Structure topics and practice atleast 300 medium level ques (min 2 approaches for each qs)
Tip 2 : Have a strong grip on Core Subjects i.e OS, DBMS, OOPS, CN, System Design(for big mnc's)
Tip 3 : Learn any good development framework and make min 2 good projects with that and try to do any 1 or 2 min intern to put it in your resume.
Tip 1 : Keep it short and to the point
Tip 2 : Have good knowledge of every single thing you mentioned there.
I applied via Campus Placement and was interviewed in Nov 2020. There were 3 interview rounds.
I applied via Walk-in and was interviewed before Jun 2020. There was 1 interview round.
I applied via Newspaper Ad and was interviewed before Jun 2021. There were 2 interview rounds.
I applied via Company Website and was interviewed before Jun 2020. There were 4 interview rounds.
MongoDB database algorithms are used for efficient data storage, retrieval, and processing.
MongoDB uses various algorithms for indexing, sharding, and aggregation.
Indexing algorithms include B-tree, hash, and text search indexes.
Sharding algorithms include range-based, hash-based, and zone-based sharding.
Aggregation algorithms include map-reduce and aggregation pipeline.
MongoDB also uses algorithms for query optimizati
I applied via Recruitment Consultant and was interviewed in Aug 2020. There were 4 interview rounds.
Talent Acquisition Executive
16
salaries
| ₹0 L/yr - ₹0 L/yr |
Intern
15
salaries
| ₹0 L/yr - ₹0 L/yr |
Data Science Intern
11
salaries
| ₹0 L/yr - ₹0 L/yr |
HR Recruiter
10
salaries
| ₹0 L/yr - ₹0 L/yr |
Junior Software Developer
7
salaries
| ₹0 L/yr - ₹0 L/yr |
TCS
Infosys
Wipro
HCLTech