I applied with an internal referral and heard back in around three weeks.

We scheduled a phone screen, which consisted of an algorithm question and a couple of minutes to chat. I had to email the recruiter to find out if I moved on to the next round (thankfully, I did).

They flew me out to Menlo Park for three on-site interviews back-to-back-to-back.

The first was a technical with two questions, the second was behavioral, and the third was another technical.

I emailed my recruiter back at the end of the three-week waiting period and got a prompt response that I had not gotten the job.

Given a file of 1s and 0s, where 1s represent two-byte characters and 0s represent one-byte characters, determine how long the last character in the file is.

Check whether a given tree is a binary search tree.

Given an array of integers, move all non-zero integers to the beginning of the array and return the number of non-zero integers. The memory can be assumed to be volatile.