Phone Interview:

There is a grasshopper that starts from the root node, if the hopper hops to a node with no children the hopper is stuck and can't move further. If the grasshopper has the option to move then it has to make the hop. Basically the goal is to find the probability of the grasshopper landing at each node.

For given graph, return probability map for each of not at time = INFINITY;

Q2: Same question in a directed acyclic graph?

Google Onsite Rounds:
Round 1
Q1: Given a list of tasks (a task have id, arrivalTime and executionTime)
At any point of time from a pool of pending tasks task with minimum execution time will be picked up first by the core.
and a single core processor to execute those tasks. You need to find the order of execution of jobs.
(https://leetcode.com/problems/single-threaded-cpu/)
Followup : Modify the code to get the order of processing using 2 cores processor.

Round 2
Q1 Given an array of building heights.
You are starting at first building. You have b (no of bricks) and r(no. of ropes). You can only move by 1 building at a time. To move to the next building,
If next building height is less or equal you can move without using any resource(bricks/ropes).
If next building height is greater you can either use bricks (1 brick for 1 unit of height) or a rope(you can climb any height using rope).
(https://leetcode.com/discuss/interview-question/528584/Google-or-Onsite-or-How-Far-Can-We-Reach-using-Rope-and-Bricks/465758)
find the maximum distance you can cover using given array, b and r.

Round 3
Q1: Given an array of N distinct unsorted integers. Return a list of numbers which can be found in the array using binary search.
Ex: If the array is [4, 3, 5, 8, 9, 6, 7] answer: 3, 5, 8, 10
(https://leetcode.com/discuss/interview-question/352743/Google-or-Onsite-or-Guaranteed-Binary-Search-Numbers)
Followup
how to prevent dynamic growing of arrayList which is storing result?

Round 4
There is a country that has multiple cities, and for simplicity each city has a 3-letter name. Some pairs of cities are connected with roads. Example:
Your friend recently took a trip around some of that country's cities. You ask them what their itinerary was, and they say: "I went to AAA, BBB, CCC, DDD in that order."

You quickly realize your friend must have misremembered, as this itinerary is impossible. BBB is not connected to CCC, and DDD doesn't exist. But, with a two-letter change, you can make a valid itinerary: AAA, XBB, CCC, DDY so you guess that was your friend's actual itinerary. You could also consider AAA, BBB, GOO, DDY, but that requires 4 letters to change so it's not as good of a guess.

Minimise the cost to validate the itenerary.

Round 5 (Googlyness)
Tell something about a project that you are satisfied with/and proud of.
Tell about an instance where you faced interpersonal problems with people around you.
Tell about an experience when you have worked with a non performer in your team and how you helped them.
Tell about the problem where you faced challenges in working with them as peer.