I applied online.

As a first step, I was given a one-hour online coding test.

After that, I was scheduled for an onsite interview at Google Mountain View.

There were four technical interviews, followed by a lunch interview.

Overall, I had a very good experience.

Problems on arrays.

1. Given an array with some random numbers, find the maximum area formed by the array elements. For example, if the array is [1, 3, 3, 2, 1], the max area is 6. If the array is [1, 3, 5, 4, 2], the max area is 9. If the array is [1, 5, 1, 1, 1, 1], the max area is 6.

2. Problems on trees. Get all paths from a node to a leaf of a binary tree.

3. Implement a sorting algorithm based on some conditions. Sort an array as much as possible based on certain conditions, like "smaller array elements moving from a higher index to a lower index should be moved only by some 'k' positions in the array."

4. Find the shortest path from a source to the destination of a graph.

Some design questions.