The process was very simple: one on-campus interview, followed by four rounds of 45-minute interviews in Seattle.

They started off the interviews with a short discussion of what they do and asked me about myself and my interests. Then, they dove into coding problems.

I have written some of the coding problems below.

1. Reverse a C-style string, given a pointer. Ensure the pointer remains pointing to the same location at the end of the operation.

2. Given 4 teams and 3 game days, create an algorithm to ensure each team plays another team every game day. By the end of the 3 game days, each team should have played one game against every other team. The algorithm should not be hardcoded and should generate relatively random matchups. (Use graph theory).