Can be done in O(n) time complexity using Suffix Trees.
On Sun, Jun 3, 2012 at 1:52 PM, atul anand <atul.87fri...@gmail.com> wrote: > can be done with O(n^2) time complexity.. > > can it be done with O(n) complexity ??? > > On 6/3/12, utsav sharma <utsav.sharm...@gmail.com> wrote: > > given a string tell wether it is valid or not. > > string is valid if there is no substring which have the same substring > > following it. > > > > these strings are not valid:- "stringstring","geek123123rt", > > "abcadabcad","strngstingstrngsting" > > > > -- > > 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. > > -- *Thanks, Jeevitesh Shekhar Singh.* -- 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.
