亚麻New Grad西雅图面经

总共3周

OA (约 5 小时)

Part 1:
a) 7 Debugging Questions - 21 minutes
b) Survey - Behavioral questions ~ 10 mintues

Part 2:
a) 2 Coding Challenges - 90 minutes
i) https://leetcode.com/problems/subtree-of-another-tree/
ii) https://leetcode.com/problems/spiral-matrix-iii/
b) Short Survey ~ 5 mintues

Part 3:
a) [CASE STUDY] Life of a Software engineer at Amazon - 2.5 hours
-> This segment had 5 modules containing a short story like structure talking about the different decisions and actions that are required to be made on a daily basis by a software developer.
-> Every module has a scenario followed by few questions that one needs to answer either based on the data given or using intuition.
b) Survey - Behavioral questions ~ 10 mintues

2周后通知我 " Final rounds " of Virtual interviews.

Virtual Interviews (3 hours)
[ 3 interviews scheduled back-to-back kind of simulating the on-site experience ]

Technical Interview 1 : - 45 minutes
a) 1 Behavioral questions based on Amazon leadership principles
b) Technical question:
https://leetcode.com/problems/valid-parentheses/

Technical Interview 2 : - 45 minutes
a) 3 Behavioral questions based on Amazon leadership principles
b) Technical question:
“A class is divided into K teams with N students on average per team. Every team has their test scores in sorted order. Develop and API to return the entire class test scores in sorted order.”
Input : A list of K lists with about N items each
Output : A list of sorted scores

Intial Assumptions :
=> Scores are INTEGER type.
=> Each team has exactly N students.

Follow up :
=> Scores can be DOUBLE type.
=> Each team may or may not have N students exactly.

Technical Interview 3 : [Probably the Bar Raiser as the interviewer was from a different team and difficulty]- 45 minutes
a) 4-5 Behavioral questions based on Amazon leadership principles
b) Technical question: [ A slightly modified version of Word-ladder-2 ]
https://leetcode.com/problems/word-ladder-ii/

Input : startWord, endWord
Output : Bool result [if the path exists from startWord to endWord]
Constraint : No word list, only access to isValidWord() method that returns true/false if the word is a valid dictionary word.

[现在等待结果!]

=>面试官会对不同的edge case进行讨论。
=>随着面试的进行,难度范围从* Easy * - * Hard *。