I think this should work....tell me if this works... void longest_0_1_substring(char *str) { int size=0,count=0,max=0,pos=0,prev=0,prev_pos=0,ptr=0,i=0,j=0;
while(*str++) size++; str -= (size + 1); while(i<size) { for(j=i;(j < size) && (str[j]==str[j+1]);++j) count++; count++; if(ptr > 1) { if(count >= prev) { if(prev > max) { max = prev; pos = prev_pos; } } else { if(count > max) { max = count; pos = i - prev; } } } prev = count; prev_pos = i; i += count; ++ptr; count = 0; } printf("substring starts at position %d and is of size %d .",pos,max); } On Thu, Aug 4, 2011 at 6:25 PM, himanshu kansal <himanshukansal...@gmail.com > wrote: > okie...can someone do it in O(n) space...bt time shld be linear only.... > > > On Thu, Aug 4, 2011 at 2:13 AM, Prakash D <cegprak...@gmail.com> wrote: > >> O(1) space is toooo hard for this task >> >> >> On Thu, Aug 4, 2011 at 12:55 AM, payel roy <smithpa...@gmail.com> wrote: >> >>> Is there any solution for the above? >>> >>> >>> On 3 August 2011 21:09, coder coder <i.code.program...@gmail.com> wrote: >>> >>>> ya amazon will be visiting our campus within few days >>>> >>>> -- >>>> 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. >>>> >>> >>> -- >>> 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. >>> >> >> -- >> 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. >> > > > > -- > > Regards > Himanshu Kansal > Msc Comp. sc. > (University of Delhi) > > > -- > 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. > -- regards Apoorve Mohan -- 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.