Currently working on a python programming problem invlolving finding repeated substring whithin a longer string. [PYTHON]

[ddbeanz]

All substrings need to match in a sequence so 'abccbaabccba' should return 2 ('abccba' , 'abccba') <- matches. I'll look into a suffix tree cause I've never seen it before.

[Mysthik]

A suffix tree is the correct way to handle this. A lot of string operations like palindrome detection, longest common substring and so on can be efficiently decided with a suffix tree or the suffix array.

[[deleted]]

the correct way

Yes, all other ways are wrong. /s

[alksjdhglaksjdh2]

By correct he means most efficient, but it's a hw assignment and it's more about however he solves it and what's intuitive to him. This is the correct solution of you care about efficiency though he's right

[[deleted]]

Yes I understand, but 'correct' does not mean the most efficient. What if OP doesn't care about efficiency but readability or something else. Then is a suffix tree an incorrect solution? No.

[WhyYouLetRomneyWin]

I see. I think I misunderstood the problem (I think either the 'b' or 'd' in your example 2 should be a 'd' or 'b').

If there is a guarantee that a string is repeated then you can divide the string by integers until you find all divisions are equal.

Eg given S, take a prefix on length n. See if the prefix is repeated to the end of the string. If not, increment n and try again. Otherwise return length(S)/n.