Amazon面筋

发信人: shineily (鬼舞十七), 信区: JobHunting
标  题: Amazon面筋
关键字: Amazon， 面筋，interview，面试，
发信站: BBS 未名空间站 (Thu Jan  1 16:05:42 2015, 美东)

拿到了offer，很久以前的了，以前写好了 忘记发出来了。

Hr: indian girl  general talk and told me the feed back from the phone
interview: communication problem

First: indian: two coding : find all files in the dir, and sub dir, non rec,
I proposed  dfs/bfs like transverse a tree, he want me to use dfs with
stack.
Another coding is:  use minheap and maxheap to find the median in a stream
of integers.

Second: one coding: subset, not exactly {1,2,3} is for subset input, his
input is {{1,2,3},{2,3},{0}},set includes sets 
Some general questions about the project and some behavior question
He is hiring manager talked 65 mins

Third: Indian girl, very easy question: reverse linkedlist by k Group, but I
spent 55 min to finish this round, and it is over time about 15mins。

Fourth: indian, coding question: 1, print the path for a binary tree with
max sum path, and no extra space.   2. find sub list in an array has biggest
product, include negative, Positive and zero, brute force n^2 and no time
to optimize the code

Fifth: Asian guy: design an alarm system in the cell phone include a lot of
funcs, like repeat by daily, weekly, monthly; how to snooze. How to check
current time need to ring or not, how to implement ring(). 

总之我觉得，你去onsite 之前，其实你能不能拿到offer 基本上已经定下来了，
onsite就是大家再进一步了解一下对方，看看是不是真的合适，感觉和相亲一个感觉，
你看了对方照片基本上心里就有个大概了。整个面试过程中大部分都是阿三，没有人为
难我，感觉还不错。

面筋贴：http://www.mitbbs.com/article_t/JobHunting/32859623.html
2014小结（一）：零背景找第一份CS工作：http://www.mitbbs.com/article_t/JobHunting/32859625.html

--
※ 修改:·shineily 於 Jan  1 16:17:23 2015 修改本文·[FROM: 54.]
※ 来源:·WWW 未名空间站 网址：mitbbs.com 移动：在应用商店搜索未名空间·[FROM: 54.]

http://www.mitbbs.com/article_t/JobHunting/32859623.html

FT中文十大 华尔街中文十大 水木十大 小百合十大 饮水思源十大 日月光华十大

京东家电价格服务大升级，30天包退 ， 更多京东优惠券