-
Notifications
You must be signed in to change notification settings - Fork 0
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.
Dudifer/BruteForceLCS
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
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
Releases
No releases published
Packages 0
No packages published