Google

A distributed rain tree graph where water starts on one node. Compute the amount of time it takes for water to distribute to all nodes. Then, optimize if it doesn't have to wait for the water to completely get to a node before passing it to another.

On-site interviews were conducted twice for two positions. The people were very friendly. Questions ranged in difficulty from median to hard. All sessions were based on coding algorithm questions. There were lots of options for lunch.

Google conducts five interviews hosted by developers across various teams. You meet with your recruiter in the morning and complete a couple of interviews. You then have lunch with an engineer and finish the remaining interviews in the afternoon. T