【每日面经】Amazon、LinkedIn、GoldmanSachs最新面经速递！
直通硅谷每日面经整理
为了帮助小伙伴们更好的准备面试
直通硅谷帮助大家整理了每日最新面经
省去自己搜索面经的繁琐
重点标红！ 我们每天都更新哦！
整理时间
2020年1月下旬
本期内容
最新面经整理
Amazon | |
WePay | GoldmanSachs |
部分面经阅读
（因为整理内容过多，这里只放有部分面经，想获取完整版的小伙伴们可以阅读下文“完整版获取方式”。）
【题目类】
WePay/OA/实习
input是年份（int） 求十月份的第二个周二是几号。 地里有答案， python 调calendar包， 据说如果用python还要check egde cases which is when the first week does not have a Tuesday。 楼主用的java写的， 不用check edge case,就一行，import java.time.*
来源：
https://www.1point3acres.com/bbs/forum.php?mod=viewthread&tid=585680&extra=page%3D2%26filter%3Dsortid%26sortid%3D311%26orderby%3Ddateline%26sortid%3D311%26orderby%3Ddateline
GoldmanSachs/OA/全职
1. 给一个数组，每七个数求一个平均值，moving average, 返回List<String>保留小数点后两位的结果。
2. Lintcode1802 Grid Game原题
来源：
https://www.1point3acres.com/bbs/forum.php?mod=viewthread&tid=585669&extra=page%3D2%26filter%3Dsortid%26sortid%3D311%26orderby%3Ddateline%26sortid%3D311%26orderby%3Ddateline
LinkedIn/Onsite/Pass/全职
第一轮面了两道题，一道是非常常见的MaxStack，我用的是BST和bi-directional linked list，另外一道跟GC相关，也是设计一个数据结构，要你实现能够
1）reserveMemory(Location l, size n)
2) write(Location l, byte[] b)
3) get(Location l)
4) free(Location l)
没有时间写具体code了就讲了一下思路
第二轮算法是BST，List<Integer> findKClosestElementInBST(int target, int k)
来源：
https://www.1point3acres.com/bbs/forum.php?mod=viewthread&tid=585659&extra=page%3D2%26filter%3Dsortid%26sortid%3D311%26orderby%3Ddateline%26sortid%3D311%26orderby%3Ddateline
【综合类】
Amazon/OA+技术电面+Onsite
Status: Pending results
Position: SDE 2
Location: Dublin
Date: January 16, 2020
Interview Process:
OA
Phone Screen
Onsite(Virtual)
Online Assessment:
A set of two questions - both problems could be solved using DFS (Something like flood fill & rotting oranges)
https://leetcode.com/problems/flood-fill/
https://leetcode.com/problems/rotting-oranges/
Leadership principles based MCQ
Phone Screen :
30 mins LP based questions
30 mins design question (file system)
https://leetcode.com/articles/design-in-memory-file-system/
Onsite: Since they had time constraints, we had to do a virtual interview.
Round 1: System design - something similar to the below
https://leetcode.com/discuss/interview-question/object-oriented-design/124542/Design-Uber-Backend
Round 2: OOP deisgn - something similar to the below, not exactly the same
https://leetcode.com/problems/lru-cache/
Round 3: purely behavioural based on LP
Round 4: LC problem using Binary Search, similar to the below
https://leetcode.com/problems/find-the-smallest-divisor-given-a-threshold/
Round 5: LC problem using DFS, somthing like below
https://leetcode.com/problems/find-winner-on-a-tic-tac-toe-game/
All rounds were divided into two parts - 30 mins technical, 30 mins LP
Overall, the interview wasa easy, but I screwed up as I had not prepared well for System design rounds. :)
Hope it helps :)
来源：
https://leetcode.com/discuss/interview-experience/484798/Amazon-or-SDE2-or-Dublin-or-Jan-2020-Pending
完整版领取方式
没看过瘾？自己翻找面经太耗时？让你的科技求职变简单不是白喊的！直通硅谷公众号每日发布最新面经，赶快置顶吧！更有按公司整理的面经大全让你一次到位！
领取方法：
扫码添加小助手，回复“面经+公司名”
得到最新面经汇总！
每天不断更！不止这些哦~
最新面经看了，可答案不确定又该怎么办？
求职准备苦，找直通硅谷
Offer又被撸，找直通硅谷
直通硅谷成立4年多以来，已累计帮助2000+学员拿到心仪offer！
依托硅谷顶尖科技公司资深工程师教师资源，针对华人学生面试短板，打造精悍高效、高技术含量且紧贴面试趋势的求职辅导课程，帮助学员提高硬核能力、熟知面试技巧，拓展职场人脉，从而进入硅谷顶尖科技公司。
专业团队，经验打造，助你全面提升求职准备效率，短时间内迅速提升面试能力！
课程详细介绍请点击↙左下角原文链接~
求职文书资料：25万字四年积累资料库，包含求职文书模板、面经资料、BQ资料等，让同学在求职的前、中、后期大大节省资料搜集时间。
