I had two recruiters during the process. Both were nice, and the interviewers were generally pleasant.

Consider it a collaborative effort to solve interesting problems.

I went through almost every stage, but somehow did not get the final VP's blessing. The recruiter could not tell me why.

Basic stuff:

Relatively practical problems often use stacks, queues, and binary search. None are expected here.

Examples include:

• Maximum points on a line given a list of coordinates.
• 3Sum variants, such as finding if a+b+c < target for integers in a given unsorted array.
• Reverse Polish Notation (RPN).

Some design questions were touched upon, including consistent hashing.