亚麻SDE 2西雅图挂经

Job Hunting Interview
, , , , , ,
1

5轮 + 午饭

  • 第一轮
    Two interviewers one was shadowing. The interview consisted of a bunch of LP questions, and then one problem https://leetcode.com/problems/letter-combinations-of-a-phone-number/
    except that it return reals words. It was like the autocomplete design problem but with keypads.
  • 第二轮
    LP questions and system design. Design a flight booking system.

Then it was lunch, the person I went lunch with was nice. We talked about Amazon and Seattle in general.

  • 第三轮
    LP questions and a DP problem. The classic one longest palindrome substring.
  • 第四轮
    LP questions and a Linked List problem. Is one of the harderst LL problem in Leetcode. The solution must be in O(nlogn).
  • 第五轮
    LP questions for an hour. It went deeper asking about the project I worked on.