The interview process was fairly long.

It started with an online application, where I sent my resume without expecting much.

I received a response requesting me to complete an online survey and a timed coding exercise. The exercise was pretty straightforward, involving some string manipulation and 1D array manipulation (similar to the "Fruit Basket" LeetCode problem).

I then moved to the next round: a phone interview over Google Docs with an engineer. I was surprised by how simple the questions were, such as deleting every other element from a linked list and some very easy string questions. I felt pretty confident afterwards.

I had to follow up with my recruiter a couple of times to help advance things along.

Finally, the onsite interview in Pittsburgh consisted of four whiteboarding technical interviews with lunch in between.

For me, there were no system design questions or anything related to my resume; the questions were straight from LeetCode or ICPC.

I felt I nailed two interviews but encountered difficulties with the other two, managing a satisfactory coded solution on all but one.

You were given the option to do the interviews on either a whiteboard or a Chromebook connected to a projector.

One of the questions was poorly formulated, and I had trouble communicating with the engineer who asked it. The others were well-understood and clear problems.

I don't recommend taking bathroom breaks mid-interview like I did, as you will feel short on time (each interview was 45 minutes).

Two weeks later, I received a phone call stating I wasn't a "good match."

Overall, it was a pretty long process, but that's to be expected for this type of job at this type of company, I guess.

Implement a data structure that supports the operations:

• flipBits(ith bit, # of bits)
• getBit(ith bit)

Consider billions of possible bits. The time complexity should be less than or equal to O(n log n), preferably.