Technical phone screen (1 hour): https://leetcode.com/problems/course-schedule-ii/

• Follow up: If you can take different course routes, then find all possible course schedule routes.
  E.g. given course dependencies:

{{3, 7}, {0, 1}, {1, 2}, {2, 3}, {3, 4}, {4, 5}, {5, 6}}

all possible schedules are [0, 1, 2, 3, 7] and [0, 1, 2, 3, 4, 5, 6]

Virtual Onsite:

• Behavioral 1
• Coding 1:
  • https://leetcode.com/problems/search-a-2d-matrix-ii/
  • Theoretical questions on multithreading
• Coding 2:
  • Binary Tree Left and Right Side views combined
  • https://leetcode.com/problems/binary-tree-inorder-traversal (Iterative)
• System Design discussion of favorite project
• Behavioral 2