Generate all unique substrings for given string

by

As other posters have said, there are potentially O(n^2) substrings for a given string, so printing them out cannot be done faster than that. However there exists an efficient representation of the set that can be constructed in linear time: the suffix tree.

More Related Contents:

  1. How can I pair socks from a pile efficiently?
  2. Unique (non-repeating) random numbers in O(1)?
  3. What distribution do you get from this broken random shuffle?
  4. How do I check if a number is a palindrome?
  5. Is there an O(n) integer sorting algorithm?
  6. Determine font color based on background color
  7. Nearest neighbors in high-dimensional data?
  8. What algorithm gives suggestions in a spell checker?
  9. How can I measure the similarity between two images? [closed]
  10. Algorithm to generate anagrams
  11. How to efficiently build a tree from a flat structure?
  12. Sum-subset with a fixed subset size
  13. What is a good Hash Function?
  14. design a stack such that getMinimum( ) should be O(1)
  15. Binary Search in Array
  16. How to check if line segment intersects a rectangle?
  17. Calculate largest inscribed rectangle in a rotated rectangle
  18. The Sieve of Atkin
  19. How to partition an array of integers in a way that minimizes the maximum of the sum of each partition?
  20. 3 dimensional bin packing algorithms
  21. Find 2 numbers in an unsorted array equal to a given sum
  22. Algorithm to find the most common substrings in a string
  23. Iterating over a Binary Tree with O(1) Auxiliary Space
  24. Peak detection of measured signal
  25. Optimizing Conway’s ‘Game of Life’
  26. “Rounding” colour values to the nearest of a small set of colours
  27. Algorithm for iterating over an outward spiral on a discrete 2D grid from the origin
  28. Tournament bracket placement algorithm
  29. How to convert decimal fractions to hexadecimal fractions?
  30. Best algorithm for matching colours.

Leave a Comment