I applied through my undergraduate college.

I went through a phone screening and a 1-hour phone interview, and then visited the Mountain View campus for three interviews (two technical).

I received an offer about a week after the on-site interviews. Everyone was really friendly and had lots of good things to say about the internship program!

• Level-order print a binary tree.
• Find the common ancestor of two nodes in a binary tree.
• Find the coverage of a bunch of intervals. For example, given [1,4), [-2,3), and [9,10), return 7.
• Given an array of integers A[1..n], make a new array B[1..n] where B[i] is the product of everything in A excluding A[i]. Solve this in O(n) time without using division.