Hi, http://geeksforgeeks.org/?p=6257
This link contains a very simple and well explained solution for the first part of the question. Thanks Amit On Mon, Oct 4, 2010 at 5:21 PM, mac adobe <macatad...@gmail.com> wrote: > Given a binary matrix, find out the maximum size square sub-matrix with all > 1s. > > For example, consider the below binary matrix. > > 0 1 1 0 1 > 1 1 0 1 0 > 0 1 1 1 0 > 1 1 1 1 0 > 1 1 1 1 1 > 0 0 0 0 0 > > > then a 3x3 1 matrix eists > > > the second question is .. if such a matrix (square matrix does not exist) > find one with maximum 1s . > > > -- > thanks > --mac > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algoge...@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com<algogeeks%2bunsubscr...@googlegroups.com> > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
