Recently I appeared for Google interviews, I was approached by recruiter on linkedin. Here are the questions I was asked in all rounds :

Round 1
We have logs printing when RPC come in and go out in format {RPC_ID, Timestamp, Type(in/out)} and a timeout time. Timeout time means after RPC has come in, it will expire after this timeout time if it has not gone out. Find the first time when any RPC will expire.

Round 2
You are given array of array in which each array represents a neighbourhood with house number. You have to rearrange houses in such a way houses in each neighbourhood is sorted, each neighbourhood size is maintained and no neighbourhood has duplicate house numbers. There can be same house number houses in multiple neighbourhood.

Round 3
Given a matrix (not necessarily a square) of size m cross n of 1s and 0s, find a square a 1s in it. Return the top left index and length of side of the square, return 0 if there is no square in the matrix. It is given than square's side is of length atleast sqrt(n).

Round 4
Given an array of positive numbers, find a subarray of size>1 with maximum min plus max value in that subarray.

There is an array arr of wind speeds on each day, a sailor has some power K
K reduces by 1 if he sails on a day and he covers arr[I] distance on that day, if he does not sail on that day distance covered is 0 and K increases by 1. Find the maximum distance he can travel.

Round 5 (Googliness)
Cancelled as I did not perform well in above rounds