Very typical. Five one-on-one interviews with different members of the team.

Each interview consisted of a 10-minute introduction, followed by a technical question, and then a 10-minute follow-up.

This process took about an hour per person. Standard.

Most interviewers were pleasant.

I guess this industry practice of asking a bunch of timed technical questions is how talent is found.

Given a list of integers, select the first 2 integers and sum them together. Let this sum be y. Remove these two integers from the list. Create a range, x, such that x = [y/2, 3y/2]. In the remaining list of integers, find all pairs of integers whose sum is in x. Remove this pair along with every other pair whose sum is in x until there are no more integers in the list or none of the remaining pairs sum is in x. | input | % 2 == 0

Dynamic programming question. Given a list of non-overlapping (but intersecting) intervals {[0-2], [2-5], [6-10]}, find the largest non-intersecting set with maximum range. I.e., in the above, | {[2-5], [6-10]} | > | {[0-2], [6-10]} |.

Recursion: Towers of Hanoi.

Priority tree invariant questions. "Complete". System design of previous projects. APIs.

Given a matrix with dimensions (n x m), create a spiral shape. x xxx x x x x x x x x xxxx Side note: This question was weird and not fully explained well, but the interviewer was nice.