找回密码
 立即注册

QQ登录

只需一步,快速开始

扫一扫,访问微社区

查看: 5537|回复: 6
收起左侧

[Amazon] Amazon面筋

[复制链接]

11

主题

6

精华

295

积分

高级会员

Rank: 3Rank: 3

积分
295
发表于 5-21-2016 02:56 PM | 显示全部楼层 |阅读模式

亲!马上注册或者登录会查看更多内容!

您需要 登录 才可以下载或查看,没有帐号?立即注册

x
Hr: indian girl  general talk and told me the feed back from the phone
: l) u0 ^, q! ?/ Ointerview: communication problem
/ z4 G" Q0 }3 ^
7 z. \1 @! ~" h* bFirst: indian: two coding : find all files in the dir, and sub dir, non rec,2 q( A+ q6 t  E& J: g
I proposed  dfs/bfs like transverse a tree, he want me to use dfs with
) _2 W, y; z% K3 L# tstack.
% |. p* {* b# Y+ Q) OAnother coding is:  use minheap and maxheap to find the median in a stream ' ]+ R" ^& q$ @4 z7 M
of integers. " E8 g, q: k/ q/ ?

9 T# Y& C9 u9 ~5 L; R; H- CSecond: one coding: subset, not exactly {1,2,3} is for subset input, his
! K) U. M, |2 dinput is {{1,2,3},{2,3},{0}},set includes sets  2 ]2 k: |! u. N( H5 m3 s+ T
Some general questions about the project and some behavior question / [4 ^3 t; y8 g+ y/ N' _. l
He is hiring manager talked 65 mins% c4 F! j: B+ Q' ^  D* p6 E
6 H1 G% L' c2 h) i* s
Third: Indian girl, very easy question: reverse linkedlist by k Group, but I0 x# l* z2 [' K  `! J, i  |2 m
spent 55 min to finish this round, and it is over time about 15mins。4 P9 U7 m8 ]" Z: M3 X

4 L9 z2 S4 ]/ K, GFourth: indian, coding question: 1, print the path for a binary tree with : ^; P6 i/ K; T4 [  h2 l7 q8 p
max sum path, and no extra space.   2. find sub list in an array has biggest0 ^& g# u, t9 [
product, include negative, Positive and zero, brute force n^2 and no time
" b% D/ ?9 r9 f6 Z$ o3 J0 f3 {to optimize the code
2 t2 D/ R& F- E
6 Y8 C; V8 Q! E$ r. w; S5 Q8 y% RFifth: Asian guy: design an alarm system in the cell phone include a lot of
- G- a8 Q( O% g9 z. o: P  Ufuncs, like repeat by daily, weekly, monthly; how to snooze. How to check
/ D( d2 d1 E/ _5 ?5 D2 wcurrent time need to ring or not, how to implement ring().  
/ `1 i$ h& ]0 v

评分

参与人数 1金钱 +3 收起 理由
Sophia + 3 很给力!祝您面试工作学习顺利~

查看全部评分

0

主题

0

精华

1

积分

新米人

Rank: 1

积分
1
发表于 5-21-2016 02:56 PM | 显示全部楼层
感谢azhao155分享~~~

781

主题

575

精华

5670

积分

顶级版主

Rank: 9Rank: 9Rank: 9

积分
5670

活跃会员热心会员优秀版主

发表于 5-21-2016 03:57 PM | 显示全部楼层
很给力!祝您面试工作学习顺利~
您需要登录后才可以回帖 登录 | 立即注册

本版积分规则

快速回复 返回顶部 返回列表