I was contacted by a recruiter who sent me information. When I was ready, I could schedule my first phone interview.

They are overbooked on interviews, so it took two weeks to get one scheduled.

They use CoderPad combined with a phone call. It's straight to business with a couple of coding problems. There was no discussion of my resume, experience, goals, etc.

If the interview isn't a solid positive, but not bad either, you might have to do a second one. It's the same as the first, with another two-week wait to get rescheduled, a different interviewer, and a different question.

The interviewers are randomly assigned from different teams. It seems to be pretty hit or miss; there is little feedback from the interviewer on what they are looking for from you. They just say thanks and that you'll hear from the recruiter afterwards.

I was told it would be pretty much a same-day response, but it took a week to hear back each time.

The first time, the feedback was that there was no issue with the solution, but the interviewer wanted a more vocal, step-by-step explanation while writing it. He did not say so during the interview, though.

The second interviewer seemed confused about a recursive solution and asked to have it redone iteratively, despite there being no performance differences. His final feedback was that the second problem did not have a full solution, despite him explicitly saying during the interview that since his request for an iterative solution took up more time, I should not write the code for the second problem, but just describe it vocally.

Both interviewers did not seem very engaged in the interview. So, I suppose the takeaway here is to always be as explicit and vocal about your solutions and try to get the interviewer to tell you definitively what they want, because otherwise, they are mostly quiet, and you only find out afterwards when it is too late.

The actual difficulty of the problems seems on the easy side. You need to be able to explain the Big O of your solutions, but none of the ones I had involved any complicated tricks.

Take an array of numbers and find the fastest way to sort it so that all 0's in the array are moved to the right side, modifying the existing array in place.

Given an array of numbers, find if there is any consecutive series that sums to a specific value.

Given a list of stock prices in historic order, find which dates to make two cycles of buy/sell would have yielded the highest profits.

Given a map between digits and a string, take a number and convert it to its string value.