The first step is a call from a recruiter to discuss your background and to learn more about the opportunity and the team. This is friendly, and as a result, a screening process is done based on this call by the recruiting team.

Then there's the coding interview, which the candidate schedules. I was able to schedule mine in four weeks.

You can also do a mock interview, which is similar to the actual interview, to get a sense of what to expect. In both, they give medium to moderately hard problems. You have 45 minutes to complete two problems.

The interviewers were all super nice to me, and I enjoyed the whole process.

In the actual interview, the first question was the closest common ancestor of two nodes in a binary tree, given the parent node as a pointer within the node itself. The second was the known file system path parsing problem. Both of these are LeetCode problems.