Sunday, May 3, 2015

http://www.mitbbs.com/article_t/JobHunting/32956215.html

电话1;
How many distinct path to go from left upper corner to bottom right corner 
in a matrix. input(row, col) --原题在glassdoor上都能找到的。
follow up 存这个中间结果矩阵啥的浪费空间,是否可以压缩一下。
How to save the internal results . -- In hashmap
How to implement the hash map  key/values what the structure, how to 
override hashcode & equals 
deep structure of hashmap
Build the own equals method and talk about hashcode
What happened if there using default hashcode and equals method
equals 结构:
public boolean equals(Object o) {
    if(o instance of ***) {
}
if( this. *** )
}

电话2:

给了一道题要check generic type
    因为type 不对,所以应该输出 compile error
给出top 10 个linux command  --Unix/Linux  是其中一个要求
public double power(double n, int p) 
直接上手lgn,写完了没事干了。面试官说,一般大家都是先用循环做的...


面试

1 Design tiny URL  then talk about how to design distributed web app system
2. SQL and database table questions. 设计个图书馆需要的表格,写一些sql找到某
个作者的所有书之类的。
3. Given a String, mark all words/sign/digis as W, S and D print out the 
words and Type
4. Using linkedList to achieve a stack function.
5. How to achieve a Singleton with read/write access control
6. Find out similar between two set -- set.retainAll
7. Code insert into heap 

每轮两个人,在一张很小的纸上写code。面试还是很专业的,中间有个国人大哥很帮忙
,就是自己刚开始面试,还是很挫的。。。
经验是简历上面的每个算法啥的都会问,会问你给我介绍下XXX, 写个公式啥的。我自
己对之前的东西准备的不充分,也该挂... 每轮1小时两个人问,茫茫多问题,写的很
慌。
他家的电面题库小,在glassdoor上面都有。看看就好了。就是简历比较难过关。投了
好多,就一个组给了面试。

No comments:

Post a Comment