The interview consisted of two parts.

During the first part, I was asked to illustrate both my academic and working background to the interviewers.

During the second part, the interviewer presented me with a programming problem that had to be solved using any language I felt comfortable using.

1. Given an unlimited stream of characters that can only be read one character at a time, using a specific function (e.g., getChar()), and a list of patterns (e.g., "cat", "dog", "man"), write an algorithm to find all occurrences of the patterns in the stream.

2. Perform a "test run" of the algorithm to assess its strong points, weak points, and eventually bugs.

3. Give an estimate of the temporal complexity of the proposed algorithm (e.g., O(x)).