[algogeeks] Re: FIND all unique substrings of a string using suffix tree

2010-10-30 Thread Saurabh Koar
Ya..I know that...I jst told da concept.I told dat modification is required...I am nt saying it is the exact solutionand modification is required -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to

Re: [algogeeks] Re: FIND all unique substrings of a string using suffix tree

2010-10-30 Thread Nikhil Agarwal
@saurabh see if you print all the unique substrings and if the test cases have unique digits then question makes no sense. My question is : if input is aaa o/p must be a,aa,aaa . On Sat, Oct 30, 2010 at 2:12 PM, Saurabh Koar wrote: > This code works when u give integer input and all the digits

[algogeeks] Re: FIND all unique substrings of a string using suffix tree

2010-10-30 Thread Saurabh Koar
This code works when u give integer input and all the digits are unique.Hope this will help u to solve your problem.U will understand the concept when u will go through the code.Modification is required.. #include //#include #include #include char *q[50]; int count=0; //counts the no of elements