Software Developer

Question - Design Uber or lyft (a ride sharing service)

Q- For an effective operating system, when to check for deadlock?
a) every time a resource request is made at fixed time intervals
b) at fixed time intervals
c) every time a resource request is made
d) none of the mentioned

You are given an arbitrary binary tree. A binary tree is called special if every node of this tree has either zero or two children. You have to determine if the given binary tree is special or not.

If the given binary tree is special, return True. Else, return False to the given function.

Note:

1. A binary tree is a tree in which each node can have at most two children. 
2. The given tree will be non-empty i.e the number of non-NULL nodes will always be greater than or equal to 1.
3. Multiple nodes in the tree can have the same values, all values in the tree will be positive.

You are given 'N' sets. Each of the 'N' sets contains positive integers, and there are at least two elements in each set. The elements contained in each set can be determined from a 2D Matrix 'SETS' having 'N' rows and 2 columns. The 'i'th' set contains all the integers lying between 'SETS[i][0]' and 'SETS[i][1]' both inclusive.

Given the 2D Matrix 'SETS', your task is to find the minimum size of a set that contains at least two elements from each of the 'N' given sets.

You are given a directed graph of several connected components (maybe only one). Every node of the graph has at most one outgoing edge and at most one incoming edge. The graph does not contain any cycles or self-loops.

There is a weight associated with each edge of the graph. Your task is to find out the number of connected components, the starting and ending node of each component, and the minimum weight in that component. It is guaranteed that each component has at least one edge.

For Example :

The example of a graph is shown in the below figure.

So, there are two connected components in the above graph. The starting and ending node of one component is 1 and 3, respectively, and the minimum weight in this component is 9. The starting and ending node in the other component is 4 and 5 respectively, and the minimum weight is 11.

Tell me about yourself.

What are your greatest strengths? 

What isn’t on your resume? 

If hired, when could you start?