由买买提看人间百态

boards

本页内容为未名空间相应帖子的节选和存档,一周内的贴子最多显示50字,超过一周显示500字 访问原贴
JobHunting版 - Amazon面筋
相关主题
问大家一个cpp中function pointer的问题G家电面题目
Two-Sigma面经careercup书上那个maintain median value的题
攒人品,twitter电话面经问两道google题
又想起一道google题目An interview question of finding the median in a moving window.
请教MinHeap用STL实现讨论一道题
帖个面试题,为了rp发个一直没有见过满意答案的题吧
问个题问个design的问题
请教一道题俺老10年前关于语言未来的论述
相关话题的讨论汇总
话题: indian话题: coding话题: hm话题: dir话题: dfs
进入JobHunting版参与讨论
1 (共1页)
s******y
发帖数: 936
1
拿到了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
w****a
发帖数: 710
2
赞分享!
S********0
发帖数: 5749
3

"总之我觉得,你去onsite 之前,其实你能不能拿到offer 基本上已经定下来了,"
那就说电面后,你的材料什么的,除了电面官会给你写个报告给recruiter,也有其他
组审阅过,觉得很有潜力才邀请onsite是么。

【在 s******y 的大作中提到】
: 拿到了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

s******y
发帖数: 936
4

店面之后,HM 会看报告吧,我觉得这个时候HM 心里就有数了。最后决定权是在HM手上
啊,只要没什么硬伤,基本上就是看HM 有多喜欢你了,我是HM 那一轮很不错,HM 说
我们只有15分钟了,那就 写个伪代码吧,然后我5分钟写完了,而且还是bug free,然
后HM 很开心,就开始聊乱七八糟的东西了。

【在 S********0 的大作中提到】
:
: "总之我觉得,你去onsite 之前,其实你能不能拿到offer 基本上已经定下来了,"
: 那就说电面后,你的材料什么的,除了电面官会给你写个报告给recruiter,也有其他
: 组审阅过,觉得很有潜力才邀请onsite是么。

I*******g
发帖数: 7600
5
马鬃这种公司, 它们其实就是找个智商没有问题的干苦力的人而已, 还有不停的半夜
on call.

rec,

【在 s******y 的大作中提到】
: 拿到了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

S********0
发帖数: 5749
6
赞深受hm喜爱
城盼hm也喜欢我

【在 s******y 的大作中提到】
:
: 店面之后,HM 会看报告吧,我觉得这个时候HM 心里就有数了。最后决定权是在HM手上
: 啊,只要没什么硬伤,基本上就是看HM 有多喜欢你了,我是HM 那一轮很不错,HM 说
: 我们只有15分钟了,那就 写个伪代码吧,然后我5分钟写完了,而且还是bug free,然
: 后HM 很开心,就开始聊乱七八糟的东西了。

t********n
发帖数: 611
7
超赞楼主!! 给0背景童鞋们好大的鼓舞!!

rec,

【在 s******y 的大作中提到】
: 拿到了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

p****w
发帖数: 90
8
nn【在 shineily (鬼舞十七)的大作中提到:】n:n:拿到了offer,很久以前的了,
以前写好了 忘记发出来了。n:n:Hr: indian girl general talk and told me the
feed back from the phone n:interview: communication problemn:n: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 n……nn
--n[发自未名空间Android客户端]
1 (共1页)
进入JobHunting版参与讨论
相关主题
俺老10年前关于语言未来的论述请教MinHeap用STL实现
Top K in N sorted array帖个面试题,为了rp
找一个stream of double 的exact median怎么做?问个题
发几个面经(6) Twitter 电面+onsite请教一道题
问大家一个cpp中function pointer的问题G家电面题目
Two-Sigma面经careercup书上那个maintain median value的题
攒人品,twitter电话面经问两道google题
又想起一道google题目An interview question of finding the median in a moving window.
相关话题的讨论汇总
话题: indian话题: coding话题: hm话题: dir话题: dfs