The interview was a three-step process:

• A HackerRank test
• A Skype call
• An onsite interview

The HR was very quick to respond, and I was "some" with my process within 2 weeks.

1. Questions about abstract and virtual functions (difficulty: easy)

2. Questions on computing the time complexity of an algorithm (difficulty: easy)

3. An algorithm was described, and a data structure had to be chosen for the task (difficulty: easy)

4. Select the 3rd largest date from a list of dates (difficulty: medium)

5. You are given a string which describes a binary search tree, for example: (A, B) (B, C) (C, D) ... where each tuple denotes a (parent, child). You need to parse the tree and report various error cases like cycle, multiple roots, multiple children, etc. If the tree is valid, you need to print the S-expression of the tree (difficulty: hard)