Google SDE On campus

Round 1

Questions: N passengers will be present, and you have to board some of them onto a ship with a maximum capacity of C. weights[] and values[] of the passengers will be given. You have to get the maximum total value and sum of weights should not be greater than C. First, all the values will be the same. In follow up values can be different for different passengers.

Follow-up Question

Was there a time when you were leading a project and had conflict of opinion with your teammate?

Round 2

Questions: A graph, source node, destination node, corrupted node will be given. Return whether you can reach the destination node from the source node. Return array of minimum distances from the source node to all other nodes. There will be a variable virality, nodes which are in range of virality distance from corrupted nodes will also be corrupted. Now return the same. There can be multiple corrupted nodes.

Round 3

Questions: Number of houses, color of first house, color of last house will be given. Colors can be in the range of [1,K]. Number of combinations you can paint the other n-2 houses such that no two adjacent houses will have the same color.