Does anybody have a stored proc they'd like to share that computes the
longest common substring for a set of strings? Wikipedia defines the
problem nicely:
http://en.wikipedia.org/wiki/Longest_common_substring_problem
Basically, given "abcba" and "abdba", the algorithm should return "ab" and
"ba" as equally valid answers.
Есть вопросы? Напишите нам!
Соглашаюсь с условиями обработки персональных данных
✖
By continuing to browse this website, you agree to the use of cookies. Go to Privacy Policy.