maximum sub sequence whose sum is half of the sub sequence length. On Tue, Jan 4, 2011 at 2:08 PM, bittu <[email protected]> wrote:
> You have a array of 0's and 1's. e.g. > 0001011101001010100101010101100111 > Find the maximum contiguous subsequence of the above sequence so the > number of 0's and 1's in that subsequence are equal > > > Regards > Shashank Mani > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]<algogeeks%[email protected]> > . > 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 [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
