Explain condition variables, how would you implement a fair mutex,
Member Technical Staff Interview Questions
4,044 member technical staff interview questions shared by candidates
I was asked to describe how I would solve some technical/coding problems.
Questions on security and a programming question
some DS
find min distance in a tree always in an optimised way no matter how many nodes are added or deleted.
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
How to find the central element in a linked list, given condition that you can trace the list only once?
Viewing 791 - 800 interview questions