The interview consisted of a series of technical questions. I had my interview through my university's career services. I sat one-on-one with the interviewer, using pen and paper to talk through the questions. After he asked me the questions, he asked if I had any questions for him about the company, and then it was over.

1. We have a linked list that is special because it can have pointers down, as well as next. Any node can have an arbitrary number of links down, as well as across. Write a function that will "flatten" this linked list so that it has no down pointers, but all elements remain in order.

2. Describe how to implement a queue out of stacks. (No coding; just thought process)

3. We have a string of characters. Write a function that will find the first non-repeating character and return that character. (Aim for an algorithm better than O(n^2))