How to find the number of distinct sub strings of n strings?

Question

Given n strings each of length <=10^5.

Input: “aa ab ac ad”

Output: 8 (“a”,”b”,”c”,”d”,”aa”,”ab”,”ac”,”ad”)

Input: “aab bcd”

Output: 10 (“a”,”b”,”c”,”d”,”aa”,”ab”,”bc”,”cd”,”aab”,”bcd”)

update:

suffix tree is one solution.But it takes more memory.

Is there any solution other than suffix tree?

Doing a simple google search should give you easily the answer : https://www.quora.com/Given-a-string-how-do-I-find-the-number-of-distinct-substrings-of-the-string — Damien Prot, Oct 03 '16 at 12:25
Read question properly i am not asking for one string@Damien Prot — pavaniiitn, Oct 03 '16 at 12:26

score 0 · Answer 1 · answered Oct 03 '16 at 12:27

0

Suffix tree. You don't need to do anything other than set the suffix tree up, it is precisely a structure that lists all the distinct sub-strings of any string or set of strings.

answered Oct 03 '16 at 12:27

Malcolm McLean

6,258
1
17
18

but it requires lot of space when the n value is large – pavaniiitn Dec 20 '16 at 12:28

How to find the number of distinct sub strings of n strings?

1 Answers1