find min distance in a tree always in an optimised way no matter how many nodes are added or deleted.
Member Technical Staff Interview Questions
4,283 member technical staff interview questions shared by candidates
Given a weight capacity, a limit on the number of shipping containers your ship can carry, a quantity of containers and their weights, and an array of port IDs at which to drop off these respective containers, return the number of cross-ocean trips required to complete the job.
Given a weighted tree having 'n' nodes, and 'k' special nodes in the tree. For each node in the tree, find the sum of distances of all the special nodes from that node. 1 <= n, k <= 100000. 1 <= weight of an edge <= 1000000000.
Given a skewed tree, an insect is sitting at the root of the tree at t = 0min, every minute insect steps down in the tree, find the probability of the insect being at any node at t = infinity. Once I came up with a solution various other complexities has been added to the problem such as: What if the tree is binary tree (written code for this) What if three is n-ary What if it is now a directed acyclic graph Handle cases that there can be more than one entry point There can be more that one way to reach a node
Given a string of numbers put commas so that it become readable like million trillion thousands. eg 1010503 ===> 1,010,503
Difference between process and thread What is NUMA What is the difference between polling and interrupt. Which one would you prefer More questions on work experience Questions related to system performance
Explain about RAID and its advantages.
Topological sorting.
Assignment: Develop a website which provides a basic Agile development board (something like Trello)
Find the greatest element in an array.
Viewing 851 - 860 interview questions