面试一:
11/20/2013
第一个联系我的公司,unpaid反而需要倒贴钱,虽然在加州也没想去了。
二十分钟的电话面试,完全没问技术问题,问了下教育专业背景让我介绍下自己的做过的project内容。由于毫无心理压力聊得很开心。
/**************************************************/
11/27/2013
收到offer letter了,让12.3之前回复。。。。不打算去了,好好修炼算法继续找吧
面试二:
11/25/2013
还在cyert hall趴着打瞌睡时突然接到一个加州的电话,发现竟然是个电面。。。。。。。
是一个刚筹到两千万刀资金的start up
对方简单自我介绍一番后,我还是没搞清楚是哪个公司打来的。。。。。
然后就开始问experience!!!!擦啊!!!!!提到的方向我啥都没有相关经历!!!!!!!!!
实在想不全问了些啥方向了,有ad-tech(这特么啥破玩意啊!!),big data(又特么的是啥玩意啊)
反正一问三不知啊!!!!!!!!!!
然后就又问我经验啊!!!!!
Describe a tool or application that you have built as a direct result of building algorithms using linked lists, hash tables, hash trees or binary trees? Was it a large scale distributive system? What kind of traffic did it experience? Did it maintain reliability and peak performances? Was it scalable?
我就扯的malloc lab的东西。。。。。。
然后就是算法题!!!!!!!!!!
深感为大技校丢大脸了!!!!!!!!
因为啥!也!不!会!!!!!!!!!!!
后来google了下,发现全是经典面试题啊!!!!:
【1】. Given two log files, each with a billion usernames (each username appended to the log file), find the usernames existing in both documents in the most efficient manner? Use pseudo-code or code. If your code calls pre-existing library functions, create each library function from scratch.
在网上搜到了一个解法,也不晓得对不对。。。。。。
go through both files simultaneously, add each entry from both files into hash. If unable to add, the element already exists.
Pseudo Code:
while((!EOF(file1)) || (!EOF(file1)