非死不可onsite之后的设计题followup面试# JobHunting - 待字闺中
l*i
1 楼
上周的onsite在这里：http://www.mitbbs.com/article_t0/JobHunting/32165741.html
周一committee meeting之后说positive，要了推荐信，昨天突然又要求加一轮设计题
的follow up面试。刚刚面的，感觉不是很好：
题目一：single machine,，给一个dictionary(key->value),每个entry takes 1KB，
总共10 Million个entry，single mutex protecting the dictionary，mutex takes
512 Byte，What potential problems do you see and how would you address them?
我直接告知我没有multi-thread programming的经历
然后问了第二个问题
题目二：给一个list的phrases，找最长的有如下规律的sequence
George Washington
Washington Park
Park Avenue
Avenue America
Suppose I give you a list of these phrases, but not in order
Q: How would you determine the longest possible chain among the set of
phrases?
问数据结构和算法。可是这个问题貌似是NP complete的
悲催啊，看来很多面FB的死在设计试题上确实不假
周一committee meeting之后说positive，要了推荐信，昨天突然又要求加一轮设计题
的follow up面试。刚刚面的，感觉不是很好：
题目一：single machine,，给一个dictionary(key->value),每个entry takes 1KB，
总共10 Million个entry，single mutex protecting the dictionary，mutex takes
512 Byte，What potential problems do you see and how would you address them?
我直接告知我没有multi-thread programming的经历
然后问了第二个问题
题目二：给一个list的phrases，找最长的有如下规律的sequence
George Washington
Washington Park
Park Avenue
Avenue America
Suppose I give you a list of these phrases, but not in order
Q: How would you determine the longest possible chain among the set of
phrases?
问数据结构和算法。可是这个问题貌似是NP complete的
悲催啊，看来很多面FB的死在设计试题上确实不假
