Redian新闻
>
My Microsoft Interview Questions
avatar
My Microsoft Interview Questions# JobHunting - 待字闺中
t*e
1
面试了6个人,题目也没什么特殊的,如果不是为面试的需要没什么必要去做。
(1) BFS traversal of a binary tree/general tree, print tree nodes of
different levels in separate lines;
(2) Design a class for gapped buffer;
(3) Imagin there is a square matrix with n x n cells. Each cell is either
filled with a black pixel or a white pixel. Design an algorithm to find the
maximum subsquare such that all four borders are filled with black pixels;
optimize the algorithm as much as possible;
(4) Give three methods to count the set-bit in a 8-b
avatar
B*p
2
第五题怎么解?

the

【在 t******e 的大作中提到】
: 面试了6个人,题目也没什么特殊的,如果不是为面试的需要没什么必要去做。
: (1) BFS traversal of a binary tree/general tree, print tree nodes of
: different levels in separate lines;
: (2) Design a class for gapped buffer;
: (3) Imagin there is a square matrix with n x n cells. Each cell is either
: filled with a black pixel or a white pixel. Design an algorithm to find the
: maximum subsquare such that all four borders are filled with black pixels;
: optimize the algorithm as much as possible;
: (4) Give three methods to count the set-bit in a 8-b

avatar
j*l
3
好像是编程珠玑的一章,用了suffix array

【在 B*****p 的大作中提到】
: 第五题怎么解?
:
: the

avatar
f*5
4
这么老的帖子都被你翻出来了?
这个题有更好的方法可以用Generalized suffix tree。
但是LCA的O(1)算法恐怕不太好写。。

【在 B*****p 的大作中提到】
: 第五题怎么解?
:
: the

相关阅读
logo
联系我们隐私协议©2024 redian.news
Redian新闻
Redian.news刊载任何文章,不代表同意其说法或描述,仅为提供更多信息,也不构成任何建议。文章信息的合法性及真实性由其作者负责,与Redian.news及其运营公司无关。欢迎投稿,如发现稿件侵权,或作者不愿在本网发表文章,请版权拥有者通知本网处理。