I applied online after hearing about them during a university presentation. They contacted me immediately and proceeded with an informal interview about my motivations and aspirations.

They expect candidates to have thoroughly researched them and to demonstrate a clear understanding of their own career goals.

Following this, we proceeded with an algorithms interview, which consisted of one averagely difficult algorithmic question. However, my presentation of the solution and my line of thought were poor, and I did not advance to the next stage (an on-site interview in Seattle, US).

Find the largest subset of a contiguous arithmetic progression in an array of n elements.