Applied online in July 2019.

Contacted for phone screen with HR in August 2019.

Onsite in Seattle in November 2019.

Four back-to-back whiteboard coding interviews, 45 minutes each.

Write the merge function for merge sort.

You have a log containing error logs from all different hardware at startup, made of hardware ID and error information. It contains multiple error logs for devices that try again. Write a method to remove the duplicates while keeping the first occurrence of the errors and all errors in the same relative order.

How would you manage heap memory for a process to do malloc and free?

You have a list of tasks to do, where some tasks depend on others. You have methods to:

1. Get all tasks this task depends on
2. Get all tasks that depend on this task
3. Get time taken by this task.

Write a method to give a valid ordering of tasks.

Follow up: Write a method to find minimum time taken to finish all tasks if you can do an infinite number of tasks in parallel.