Very fast and professional.

Applied online around late August and heard from a recruiter the next day. Had a phone interview within a week.

The first interview was pretty standard and easy, involving a tree question where I had to write code in Coderpad.

The recruiter got back to me within 2-3 days and scheduled another phone interview, which I was told would be the final one.

This second interview was a video chat on Skype (which I didn't expect) and was SIGNIFICANTLY more difficult.

I was grilled on questions about:

• OOP concepts
• Data structures
• Javascript
• Various sorting algorithms (which I had to implement in Coderpad)
• Databases (including questions about specific databases like MongoDB, DocumentDB, etc.)
• Graph/tree algorithms
• Previous projects, etc.

The interview was supposed to be 45 minutes, but it went well over an hour.

I thought it had gone badly, but was contacted by the recruiter the day after with an offer.

Implement a breadth-first search function in CoderPad.

Implement merge sort in CoderPad.

What is the difference between merge sort and quicksort? What are the advantages and disadvantages of each?

• Merge Sort:
  • Advantages: Stable, guaranteed O(n log n) time complexity.
  • Disadvantages: Requires extra space for merging (O(n)).
• Quicksort:
  • Advantages: In-place sorting (typically O(log n) space), often faster in practice due to better cache performance.
  • Disadvantages: Worst-case time complexity of O(n^2) if pivots are chosen poorly, not a stable sort.