The recruiter gave me a HackerRank interview link, which had 10 multiple-choice questions and 2 coding questions (not very difficult).

After completing that, I had one on-site interview, which consisted of two technical interviews. One focused on concurrency, and the other on algorithms/data structures.

If I had made it through the first round (which I didn't), they were planning to schedule another on-site interview to test me on design and algorithms.

This was my first technical interview in about 5 years, so I did not expect it to go super smoothly. Even though I answered most of their questions, I can understand why I didn't make it through.

Consider a time scale. At random points in time, register callback functions will be invoked. These callback functions are waiting on an event that will fire at some point in time. By the time the caller registers the callback:

• If the event had already happened, the caller should execute the function.
• Otherwise, the callback needs to be registered and executed once the event has fired.

After the event has fired, any callback dependent on it can be executed without needing to be registered again.

1. Solve for the single-threaded application case.
2. Solve for the multi-threaded application case. a. How can we ensure that register callback functions do not wait excessively to queue in the callback?

Buddy Bitmap Question:

Do a Google search for this question, and I bet Pure Storage will come up at the top. I was asked to implement clear_bits(int start, int numbits), assuming the input is well-behaved.