I applied via the website for the full-time Software Engineer position.

Within a week or so, I received an email from a recruiter for a 30-minute phone screen interview.

After the phone screen, I heard back within a week regarding the four onsite (virtual) interviews, scheduled for four weeks later.

On the onsite day, I had two back-to-back interviews in the morning, followed by a two-hour break, and then two more back-to-back interviews in the evening. (This was within the workday for PST, though scheduled in EST.)

Given a sorted linked list with two nodes swapped, how would you fix it?

Given a sorted array where the only operation you can perform is .elementAtIndexX, find the index of an element you're looking for. You are not aware of the size of the array and can only use the provided function to get the value of an element at index x.

Given a binary tree, find the minimum path length from root to leaf.

Given an IPv4 string in dotted decimal representation, return its 32-bit integer representation.