About

an algo finding the longest common substring between two strings the hard way: generating all possible substrings of both and storing in a set, using set intersection to find all common substrings, and then finding the lcs within that new set.

Stars

Watchers

Forks