I was contacted by a Google recruiter and required to provide a resume.

I was then contacted by someone from Google and given a phone interview with simple algorithm questions, including Big O analysis.

I then did the onsite interview with five 45-minute whiteboard sessions, most involving coding but one involving systems design.

That led to my submission to the Hiring Committee.

After that, three of the divisions called me to determine whether I was a good fit for their team and also to sell their department to me.

Finally, I was sent on to the Executive Board, who made the final decision.

How can you determine the height of a tree structure? What is the Big O Complexity of the algorithm?

Will your answer change if you don't have to get an exact result? What is the tradeoff?

For a two-dimensional array of arbitrary size (not guaranteed to be square) containing binary values, find the total number of rectangles defined by four corners and parallel to the array's dimensions.

How might one define an algorithm to determine whether the placement of a stone in Go captures an area? What information might you store to speed up later calculations?