The interview process consisted of three rounds:

A written test, followed by a one-on-one interview with an existing full-time employee. This was then concluded by an onsite interview with a panel of interviewers. Interviews were technical, with the exception of the group interview where a few general questions were asked. Hiring was a simple phone call and email, followed by a one-day onboarding process that handled legal details and company policies.

The most difficult question started with a recursion of the Fibonacci series. It then progressed into obtaining algorithms that fit a use case. For example, create a recursion that generates a subset of the sequence represented by a binary tree, but has to execute in O(n log n) time.