G新鲜面经# JobHunting - 待字闺中
f*l
1 楼
1.1 gas station
1.2 一个数组,找出一个solution使得1st《2nd, 2nd》3rd。。比如15462就是数组1
,2,4,5,6的一个solution。大牛指点下这个怎么弄?
2. most frequent character in a huge string (10works 1master), 如果一个big
文件在一个机子上怎么弄,如果多个小文件在多个机子上怎么弄?
3.1. return random node of a list, what if it can be modified concurrently
3.2. 1k Ads, how to make it only appear once across all servers, no master
server
4.check generalized tree, follow up:return all generalized tree of its
children, 比如
1
2 3
4 5 6
这种情况下,2,4,5,6是valid的节点。
5.how to design general cache
1.2 一个数组,找出一个solution使得1st《2nd, 2nd》3rd。。比如15462就是数组1
,2,4,5,6的一个solution。大牛指点下这个怎么弄?
2. most frequent character in a huge string (10works 1master), 如果一个big
文件在一个机子上怎么弄,如果多个小文件在多个机子上怎么弄?
3.1. return random node of a list, what if it can be modified concurrently
3.2. 1k Ads, how to make it only appear once across all servers, no master
server
4.check generalized tree, follow up:return all generalized tree of its
children, 比如
1
2 3
4 5 6
这种情况下,2,4,5,6是valid的节点。
5.how to design general cache