This is a demo program to solve the LCS problem using the technique of Dynamic Programming.
In order to better visualize the the results, some emojis are used for display. Enjoy!
-
Notifications
You must be signed in to change notification settings - Fork 0
chubillkelvin/longest-common-subsequence
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
A demo program written in Python 3 to solve the LCS problem with Dynamic Programming (caution: emojis used for better visualization and some extra fun).
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published