Re: [algogeeks] Microsoft Interview Question

@rahul: I got my fault. I didn't thought about that test case. I am thinking about applying DFS traversal algorithm for graph here. It may work here. On Wed, Oct 17, 2012 at 9:01 AM, Rahul Kumar Patle < patlerahulku...@gmail.com> wrote: > @navin: still i am not getting your solution.. can you mak

[algogeeks] substring in big string

there is a big string which needs 2GB memory to fit in but you have only 100mb. Find a substring in the big string. Best Regards Ashish Goel "Think positive and find fuel in failure" +919985813081 +919966006652 -- You received this message because you are subscribed to the Google Groups "Algori

Re: [algogeeks] C output

#include int main() { char str[]={'a','b','c'}; char str1[]={"abc"}; printf("%d",sizeof(str)); printf("%d",sizeof(str1)); getchar(); } This is giving 3 in case of str and 4 in case of str1 bcz str is "array of character" and str1 is a "string". For understanding this point cons