12/6 Amazon New Grad 三轮VO面经
34093
BQ:
第一轮 : Example of when you didn’t know anything about what you were working on and needed to learn
第二轮 : Example of how you dealt with challenges (timelines etc.) in your projects
第三轮 : Example of ownership where you went above and beyond to deliver results依據我說的都有follow up questions
第一轮问了Scheduling问题, 主要Check if new timeslot overlap with existing timeslots in the collection. 我用Java做，所以用了Java Instant。面试官非常要求Clean + readable code, 還要each function do as little as possible, 所以用了很多helper function。面试官在一个小型会议室的房间，离镜头和麦远，一直有回音
第二轮问了Given a 3x3 matrix with letters in each posiiton, return list of words given in dictionary(array or list) that can be formed form the grid --> definition of "can be formed by grid" is letter has to be a neighbour of previous letter (neighbours can be up,down,left,right,or diagonal)
e.g. dict
A H K AHC
H J I DOOG
U C E CJHKJH
return ("AHC", "CJHKJH")
面试官是個女的人很好, 開始讨论了一下时间复杂度之类的還有optimal solution, 但只寫了个non-optimal, 然后口头跑一次test case时间不多就差不多结束了
第三轮问了Create a Cache, 讨论了用哪个data structure，后来用了hashmap combined with linked list, 然后写完get, put, remove。面试官感覺沒耐性，中間還出去。
終於面完了！也不知道能不能过，最近发面经的不多，所以我就share一下，希望可以幫到大家！
第一轮 : Example of when you didn’t know anything about what you were working on and needed to learn
第二轮 : Example of how you dealt with challenges (timelines etc.) in your projects
第三轮 : Example of ownership where you went above and beyond to deliver results依據我說的都有follow up questions
第一轮问了Scheduling问题, 主要Check if new timeslot overlap with existing timeslots in the collection. 我用Java做，所以用了Java Instant。面试官非常要求Clean + readable code, 還要each function do as little as possible, 所以用了很多helper function。面试官在一个小型会议室的房间，离镜头和麦远，一直有回音
第二轮问了Given a 3x3 matrix with letters in each posiiton, return list of words given in dictionary(array or list) that can be formed form the grid --> definition of "can be formed by grid" is letter has to be a neighbour of previous letter (neighbours can be up,down,left,right,or diagonal)
e.g. dict
A H K AHC
H J I DOOG
U C E CJHKJH
return ("AHC", "CJHKJH")
面试官是個女的人很好, 開始讨论了一下时间复杂度之类的還有optimal solution, 但只寫了个non-optimal, 然后口头跑一次test case时间不多就差不多结束了
第三轮问了Create a Cache, 讨论了用哪个data structure，后来用了hashmap combined with linked list, 然后写完get, put, remove。面试官感覺沒耐性，中間還出去。
終於面完了！也不知道能不能过，最近发面经的不多，所以我就share一下，希望可以幫到大家！
- 16
3条回复