I can't remember the first interview, but it involved standard coding tests.

The secondary interview was in-office and with four people. Various questions were asked, usually related to coding and algorithms. These were generally basic concepts, such as knowing the runtime of your algorithms and ensuring everything is in the smallest Big O possible.

Sample questions included:

• Correcting a series of code
• Finding the largest algorithmic progression
• Regular palindrome shenanigans
• A coding question effectively asking to "Merge Two Sorted Lists"

Disjoint algorithmic progression:

Given a set of numbers in no given order, find the longest algorithmic progression, assuming you can skip items as you desire.