Thread: Find all substring

Given a string, think of the best possible method to find out all the substrings of all possible lengths present in it.

Use Suffix trees to do it in Linear time.
http://www.allisons.org/ll/AlgDS/Tree/Suffix/