Interview Questions# JobHunting - 待字闺中
N*w
1 楼
(1) Imagine 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.
(2) Given an arbitrarily long string, what is the most efficient way to find
out the first repeating character?
(No Suffix Tree algorithm)
(3) Find the longest parlindrom from a string.
(No Suffix Tree algorithm)
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.
(2) Given an arbitrarily long string, what is the most efficient way to find
out the first repeating character?
(No Suffix Tree algorithm)
(3) Find the longest parlindrom from a string.
(No Suffix Tree algorithm)