s*0
1 楼
上星期五刚刚去amazon面了onsite，我是通过online test过去的，不知道今年这个东
东amazon是怎么想的，周五同面的二十多个人有几个也是online test过去的，我
online test有三道题，find circle in linked list, calculate five max grade
students and merge two sorted linkedlist.
onsite一共四轮，面完之后大家交流了一下，貌似很少有相同的interviewer，第一个
是印度哥们，原谅我拙劣的英语吧，交流都有困难，preorder recursive and
iterative approach, find all numbers that appear in an array once,我先用
hashtable，然后他说如果不用怎样。。第二个是中国人，开始面的挺开心，find
largest 1000 points near one position(e.g. (x0,y0)), then he said if the
points I give you is very large, how could you do. somthing like external
sort. The second question is output index of all pairs that sum to specific
value, input is an integer array.第三个是个美国人，find intersect of two
singled linkedlist and how could you pass information of binary tree for
user to construct the same binary tree.第四个依旧是两个美国人,貌似只有一个问
题，an array only contains 0 and 1, and sort this array without extra buffer
and do this in one interation
一周之内就知道结果，希望可以好运降临，发帖求人品呀~~~
东amazon是怎么想的，周五同面的二十多个人有几个也是online test过去的，我
online test有三道题，find circle in linked list, calculate five max grade
students and merge two sorted linkedlist.
onsite一共四轮，面完之后大家交流了一下，貌似很少有相同的interviewer，第一个
是印度哥们，原谅我拙劣的英语吧，交流都有困难，preorder recursive and
iterative approach, find all numbers that appear in an array once,我先用
hashtable，然后他说如果不用怎样。。第二个是中国人，开始面的挺开心，find
largest 1000 points near one position(e.g. (x0,y0)), then he said if the
points I give you is very large, how could you do. somthing like external
sort. The second question is output index of all pairs that sum to specific
value, input is an integer array.第三个是个美国人，find intersect of two
singled linkedlist and how could you pass information of binary tree for
user to construct the same binary tree.第四个依旧是两个美国人,貌似只有一个问
题，an array only contains 0 and 1, and sort this array without extra buffer
and do this in one interation
一周之内就知道结果，希望可以好运降临，发帖求人品呀~~~