- #美国面经
- #码农类general
- #面试经验
- #amazon
AMAZON new grad 3 rounds VO 面经
一亩三分地匿名用户192816
Timeline 11/27 OA pass.1.28 invited
2/6 VO
First round:
What if you found out that the approach u are using is wrong,
Tell me about a time
本帖隐藏的内容需要积分高于 188 才可浏览，点击前往一亩三分地论坛阅读。
here is a consecutive charactors that form a word in the set. Return the words every time encounterd.(You can only use hasNext and next to get ONE char each time).
我想了两种方法，一个是rolling hashing， 一个是Tire, 但是貌似都没法O(N) 时间内解决，我告诉他我这两种一个n^2 一个 nlogn的样子，没写完，但探讨了很多。
2/6 VO
First round:
What if you found out that the approach u are using is wrong,
Tell me about a time
本帖隐藏的内容需要积分高于 188 才可浏览，点击前往一亩三分地论坛阅读。
here is a consecutive charactors that form a word in the set. Return the words every time encounterd.(You can only use hasNext and next to get ONE char each time).
我想了两种方法，一个是rolling hashing， 一个是Tire, 但是貌似都没法O(N) 时间内解决，我告诉他我这两种一个n^2 一个 nlogn的样子，没写完，但探讨了很多。
