骑驴找马,面了大中小三家, 感觉现在华人找工作真不容易,以后只会更难.如果你是大
牛,恭喜你,哪里都欢迎你.问题是很多人都是普通的.如果是一般老中老印都能干的,绝
大部分都会给A3的亲朋好友,你无法想象他们的家族圈子有多大,而且给家族的人找工作
是他们义不容辞的责任, 和中国人之间的严格把关不好比.
还有是越低端的engineer问的越具体,越难,牛人一般不会问你个TREE算法,然后和你扣
边际条件.一些级别很高的人问的是自己工作上遇到的.open-ended难题,也想看看你是
怎么想的.
FAIL了的同学不要气馁,不要丧失信心.适合你的公司是在等你,也许比剧了你的公司更
好.
面经:
1) distributed system (someone asked for distributed systems b4)
If thousand of machines, each has billions of number, return the median
A: http://www.quora.com/Distributed-Algorithms/What-is-the-distributed-algorithm-to-determine-the-median-of-arrays-of-integers-located-on-different-computers
2) Convert Binary Tree to a data-struct then convert back.
Traditional answer is to convert to pre-order and in-order, then convert
back. but I think the following way are also fine, any ideas?
: convert to only pre-orders, fill -1 for empty leaf, to make it every node
has two children, when converting back, adding empty node if value is -1 (
assuming all number are positive)
3) Implementing a spinlock.
4) Intrusion proof login function 保证任何输入时候算法时间一样.
还有其他标准LC题:
pathsum
3sum
LRU
median for 2 sorted array
No comments:
Post a Comment