Re: [algogeeks] Re: amazon

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. -- Thanks and Regards, Manish Pathak ** TimesJobs.com manish.pathak*@*timesgroup.com Mo

Re: [algogeeks] Mouse Beer Puzzle

answer is 3 -- Thanks and Regards, Manish Pathak ** TimesJobs.com -- 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

Re: [algogeeks] books

this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- Thanks and Regards, Manish Pathak ** TimesJobs.com Mo. 9015687266 -- You received this message because you are subscribed

Re: [algogeeks] Re: Finding non-repetitive element from an Array with complexity n

--- 01 01 XOR 10 --- 11(3) So answer is 3. Any query??? -- Thanks and Regards, Manish Pathak ** TimesJobs.com Mo. 9015687266 -- You received this message because you are subscribed to the Google Groups Algorithm Geeks

Re: [algogeeks] Permutation of a string

]=st_char; main_ctr++; } printf(\nDesigned by Manish Pathak ); } -- 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

Re: [algogeeks] [brain teaser ] 1april

Hi kamakshi I think, kusum answer's is right, can u explain why A not??? -- Thanks and Regards, Manish Pathak ** TimesJobs.com Mo. 9015687266 *http://manishpathak-mobile.blogspot.com/* -- You received this message because you are subscribed to the Google Groups

Re: [algogeeks] Re: 28march

. -- Thanks and Regards, Manish Pathak ** TimesJobs.com Mo. 9015687266 http://manishpathak-mobile.blogspot.com/ -- 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

Re: [algogeeks] Amazon Question

. 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. -- Thanks and Regards, Manish Pathak ** TimesJobs.com Mo. 9015687266 -- You received this message because you

Re: [algogeeks] brain teaser

://groups.google.com/group/algogeeks?hl=en. -- Thanks and Regards, Manish Pathak ** TimesJobs.com manish.pat...@timesgroup.com Mo. 9015687266 -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks

[algogeeks] Please check it out

#includestdio.h void main() { int a[]={0,1,1,1,1,1,0,0,0,0,0,1},i=0; static int o=0,e=0;//e for no. of 1's in array and o means no. of 0 in array int l=sizeof(a)/4; while(il) { if(a[i]==0) {o++;i++;} else {e++,i++;} } if(eo) //if n0. of 1's greater than no. of 0's then e=o e=o;