Round 1 (45 Mins):
Given an undirected graph with some faulty nodes where you are not allowed to visit. Is it possible to reach from node A to node B?
Follow up: If we consider the cost to be 1 of each teleportation what’s the minimum cost?
Follow up: if we can repair the node by paying amount C (C can be different for each faulty node). What's the minimum cost now?
Follow up: if we can repair the node by paying amount C (same cost for all faulty nondes.). and all other nodes are free to travel, what's the cost now?
Round 2 (1 Hour):
Given an undirected graph, Alice and Bob are standing somewhere (node index is given), They want to reach a common destination D such that the number of unique edges they traverse is as minimum as possible. (Most hops should be common.!)
Googliness:
- One of the ambitions which you were able to accomplish!
- One of the ambitions, which you were not able to accomplish!
and some follow-ups..
Round 3 (1 Hour):
K window of a list = distinct elements in the first K elements
Given 2 lists, modify list2 such that the k windows of the 2 lists don't have any common element. Return the new list (Asked to optimize the space multiple times).
Variation:
Instead of 2 lists we have n lists, and a distance parameter d, the k window of a list shouldn't have any common element with any of the previous 'd' lists. Return the new lists
Googliness:
- Tell me about a time where you had to incorporate feedback from your team as well as users of your application.
- How do you manage a deadline if you know you can’t complete the assigned work?
- Suppose, you are a team leader and one of your team members is not supporting your views but other people are! How would you handle it?