http://geeksforgeeks.org/?p=767
On Jul 26, 11:49 pm, Pratz mary <pratima.m...@gmail.com> wrote: > how? > > On 26 July 2011 23:18, ankit sambyal <ankitsamb...@gmail.com> wrote: > > > @vivin : Suffix trees are memory intensive.. > > > This problem can be solved just by running 2 nested loops in O(1) > > space and O(n^2) time > > > -- > > 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 Pratima :) -- 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.
