微软 Bing Ads team 面经# JobHunting - 待字闺中
n*5
1 楼
跪谢板上国人内推orz。在吃饭的时候还有国人MM给我加油...还是挂了 lol
一轮电面
1.If database need to be scale up, how to scale up database tables.
What if sql querys can not handle what need to do?
2. How to test your query whether it is right or not. How to run the
testcase? ..
3. Word Break II
面试：
1 Code at computer : Pronunce 123 212 312 → into one hundred twenty-three
million ….
2. Design question : given series of jobs, if timeout figure out which job
may be the key point of the series job.
He suggested using heap to find out the largest delayed job. 挂在这轮上了。
3. With HM. Given a file with repeating words, find out the top K words
that are repeating.
Using a heap for order and a hashmap for store the keywords and update
the sequence. Follow up with what to do if the hashmap is too large to fit
into the ram ? How to extend this problem into distributed environment ? →
save in files in disk.
How to sort the result, what are the time complexity. → two way merge sort
and similar like quick sort. can do it in a map reduce way, write into
multiple files and merge the result.
4. Coding on white board
How to tell how many bit different between two integer
Find number of island in int[][] island are 1’s that are connect together.
可以直接在原始矩阵上面改动
Given a graph, find out minimum path between two node -- Dijkstra
吐槽：整个过程就是个混乱。中间跟我联系的recruiter离职了。我的所有文件都没有
收到,NDA啥的现在都没签，面完了说一周出结果，现在俩月了，也没人理。报销也没给
我连接啥的，不过催了新的recruiter，特别给我办了。
临行前一天都没人理我，我怒了发信问说你们安排好了么， 有啥schedule提前给我发
一下，要不姐就不去了，这才有人理。宾馆高大上。安排了两天的时间，第一天就
recruiter 10分钟电话聊了下。休息的很好，还四处逛了逛。微软的小分部，门口就是
lv店。
每个面试官面完了之后都会跟下一个面试官聊聊，通通气。本来有5轮，但是第五个人
找不到了，也就这样了。
一轮电面
1.If database need to be scale up, how to scale up database tables.
What if sql querys can not handle what need to do?
2. How to test your query whether it is right or not. How to run the
testcase? ..
3. Word Break II
面试：
1 Code at computer : Pronunce 123 212 312 → into one hundred twenty-three
million ….
2. Design question : given series of jobs, if timeout figure out which job
may be the key point of the series job.
He suggested using heap to find out the largest delayed job. 挂在这轮上了。
3. With HM. Given a file with repeating words, find out the top K words
that are repeating.
Using a heap for order and a hashmap for store the keywords and update
the sequence. Follow up with what to do if the hashmap is too large to fit
into the ram ? How to extend this problem into distributed environment ? →
save in files in disk.
How to sort the result, what are the time complexity. → two way merge sort
and similar like quick sort. can do it in a map reduce way, write into
multiple files and merge the result.
4. Coding on white board
How to tell how many bit different between two integer
Find number of island in int[][] island are 1’s that are connect together.
可以直接在原始矩阵上面改动
Given a graph, find out minimum path between two node -- Dijkstra
吐槽：整个过程就是个混乱。中间跟我联系的recruiter离职了。我的所有文件都没有
收到,NDA啥的现在都没签，面完了说一周出结果，现在俩月了，也没人理。报销也没给
我连接啥的，不过催了新的recruiter，特别给我办了。
临行前一天都没人理我，我怒了发信问说你们安排好了么， 有啥schedule提前给我发
一下，要不姐就不去了，这才有人理。宾馆高大上。安排了两天的时间，第一天就
recruiter 10分钟电话聊了下。休息的很好，还四处逛了逛。微软的小分部，门口就是
lv店。
每个面试官面完了之后都会跟下一个面试官聊聊，通通气。本来有5轮，但是第五个人
找不到了，也就这样了。
