Interviwed at Google HQ. Most of the questions were related to BFS and DFS algos:
Warning : Poorly wrritten but you'll get the idea

Round 1:

• Chocolate sweetness

Round 2:

• Shortest Path in a Grid

Lunch

Round 3:

• Knight's Shortest Path on an Infinite Chessboard
  Suggested BFS solution. interviwer was not really interested in taking my interview. most of the time he was busy with his phone. checking messages. This was completely unexpected from a Google interviewer.

Round 4:

• Tree related. find the longest AP series (increasing or decresing) in binary Tree.

Round 5:

• Given N-ry tree, each child has it's own distance from parent, water is poured on top of the tree, find the time when farthest node will be wet.

Result: Rejected. LAME Feedback: DSA and communication skills were good but coding speed was not as par expected. Still can not digest this feedback. Hope this helps.