Hi,
Print all the substrings of a given string. Is there any
solution better than O(n^2).
Eg: abc the possible substrings are {"a","b","c","ab","bc","abc}
--
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.
