given an array of size N containing only 0s and 1s return the length of the maximum sub array containing equal number of 0s and 1s
Give a O(n) solution It has been asked before in this forum but no one has given a proper solution so m asking again May be we need DP here..But what will be the recurrence . I cant get it :( Ankur -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@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.
