Met Google at a campus career fair and signed up for an interview.

Had two on-campus interviews:

• One on algorithms
• One on data structures

Both interviews were about 45 minutes long and launched right into the problems, with little small talk beforehand. I did the coding on a sheet of paper.

After that, I had a phone interview, which was more informal, focusing on a discussion of my technical background and projects.

Problem 1: Effectively boiled down to "Find the ith largest integer in an array of integers". The solution was order statistics (http://en.wikipedia.org/wiki/Selection_algorithm).

Problem 2: Given a simple cellular automaton. Asked to design a data structure to represent it using the least amount of memory possible. Then asked to implement an algorithm to make the automaton take a step (following a set of rules) and make it as efficient as possible.