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
@chi .. can you please share what is this and how it resolves the issue at
hand ?
regards
--mac
On Mon, Oct 4, 2010 at 5:50 PM, Chi c...@linuxdna.com wrote:
Traverse the matrix in z-order, or hilbert-order. This is a heuristic-
algo.
On Oct 4, 1:51 pm, mac adobe macatad...@gmail.com wrote
You are given a very long array of integers . Some number in this integer
array come 1 time , some 2 times some 3 times . create 3 different arrays .
Array 1 will have numbers with numbers comming only1 time , Array 2 will
have numbers with numbers comming 2 times, Array 3 will have numbers with
How would you identify a binary search tree of maximum nodes in a binary
tree ?
--
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
No parody .. that would be another doubt :(
On Sat, Sep 25, 2010 at 11:03 PM, prodigy 1abhishekshu...@gmail.com wrote:
By maintaining a current maximum and a global maximum. You do know how
to verify a BT is BST .
http://pastebin.com/xwXXTEnP
On Sep 25, 9:04 pm, mac adobe macatad
@parody :..and how would that find me a maximum size BST .. ??
( for checking if this BT is BST i would do inorder traversal and see if it
is increasing )
On Sun, Sep 26, 2010 at 11:10 AM, mac adobe macatad...@gmail.com wrote:
No parody .. that would be another doubt :(
On Sat, Sep
