-1

My Problem is to find the most common substrings of a given string, which are the longest at the same time (not part of a longer substring) in an efficiently way (-> long strings)

Any ideas?

tihox1
  • 54
  • 6

1 Answers1

0

Are you looking for Longest Common Substring or Longest Common Subsequence? In any case, Geek Viewpoint's Longest Common Subsequence should help you get the answer

Konsol Labapen
  • 2,424
  • 2
  • 15
  • 12