Phone screen:

• Skip Iterator

Onsite:

Round 1:

• You're given a list of coordinates on a 2d plane. Return the area of the largest rectangle formed by 4 coordinates.
  Follow-up: what if the rectangle can be any orientation (i.e. a diamond shape).

Round 2:

• Design splitwise.

Round 3:

• Light String
  Follow-up: each call to update lights will cost O(n) order complexity. Can this be improved? The interviewer hinted that some kind of action history might help, but I didn't really understand how to implement.

Round 4:

• You're given two sets of coordinates. One set refers to a list of google bikes, the other refers to a list of google employees. Bikes:Employees is always 1:1, and there are no obstacles. Create a function that will return a path for each employee to a bike. Follow up: reduce the worst case path length (i.e. optimize paths).
• NOTE: this is not https://leetcode.com/problems/campus-bikes (premium) -- the on-site prompt restricted movement to a single cell at a time. Manhattan distance was not an option.

Round 5:

• Leftmost column index of 1