awesome solution Don . Thanks. On Thursday, January 17, 2013 12:38:35 AM UTC+5:30, marti wrote: > > 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 >
--
