顶风作案,Google面经# JobHunting - 待字闺中
T*8
1 楼
看大家都吵得不亦乐乎。作为一个深度潜水员和WSN,我就顶风而上,去年面试NYC
Google
1. 在直方图里面找Biggest Square. 没有准备这个提,答的不好
2. 在一个N Dimensional 的正方形里面,Assume the top right point is (n,n,....
n) and bottom left point is (0, 0, 0.... 0), given any point in the cube,
find all the paths inside the cube to the (n, n,...n)
3. Given a matrix with values of 0 and 1, for any point, if there are three
1s around it, change its value to 1. Otherwise, mark its value to 0 (cannot
recall exactly anymore). how to do it. Given a very big such matrix and n
computer, how to do it efficiently. Assume each computer has very limited
memory, how to do it.
4. Network related questions since I was a network guy
5. Design question...
1. 在直方图里面找Biggest Square. 没有准备这个提,答的不好
2. 在一个N Dimensional 的正方形里面,Assume the top right point is (n,n,....
n) and bottom left point is (0, 0, 0.... 0), given any point in the cube,
find all the paths inside the cube to the (n, n,...n)
3. Given a matrix with values of 0 and 1, for any point, if there are three
1s around it, change its value to 1. Otherwise, mark its value to 0 (cannot
recall exactly anymore). how to do it. Given a very big such matrix and n
computer, how to do it efficiently. Assume each computer has very limited
memory, how to do it.
4. Network related questions since I was a network guy
5. Design question...