亚麻多伦多过经

Job Hunting Interview
, , , , , ,
1

店面

BQ + 2 coding:

  1. merge two sorted arrays
  2. write a Trie and follow up questions

Onsite 五轮

第一轮: [bar raiser]
BQ questions [30 minutes]
Coding:

  1. Given a set of die (varying sizes) with characters instead of numbers check whether a word can be formed
  2. Follow up, can we do better than exponential time and testing

第二轮 [behavorial]
BQ questions [1 hour] - with a manager

第三轮:
BQ questions [20 mins]
Coding:

  1. Zigzag printing of binary tree (gave a recursive solution and then followed up with a iterative sol O(1) space (https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/)

第四轮:
Coding:

  1. longest slope in a map, could only go downwards [DFS with memoization, took 10 mins] spent the rest of the interview with LP questions

第五轮:
Discuss projects and design question:

  1. Design UberEats and follow up