📚 String comparison and edit distance algorithms library, featuring : Levenshtein, LCS, Hamming, Damerau levenshtein (OSA and Adjacent transpositions algorithms), Jaro-Winkler, Cosine, etc...
-
Updated
Jul 3, 2022 - Go
📚 String comparison and edit distance algorithms library, featuring : Levenshtein, LCS, Hamming, Damerau levenshtein (OSA and Adjacent transpositions algorithms), Jaro-Winkler, Cosine, etc...
Aditya Verma (Youtube) DP Playlist Codes/Solutions.
Leverage the power of modern C++ to build robust and scalable applications
An official event app for HackRU
Fast and simple algorithms for computing both LCSk and LCSk+
Libra Canonical Serialization (LCS) library in golang
A savegame editor for Grand Theft Auto: Liberty City Stories.
Go implementation of the Patience Diff algorithm
LCS is an algorithm to find the Longest Common Subsequence between two Strings.
An implementation of the `Longest common substring` algorithm for PHP.
This Repository is all about the Popular Dynamic Programming Concepts and their Variations Which can be helpful to Competitive Programming as well as Coding Interviews. I have added the Resources from where I have learnt these topics and their Codes. In future, I would like to add my own English and Bengali Explanation to Each topic.
Longest common subsequence using MPI
A tic-tac-toe bot that you cannot defeat, written in JavaScript and based on a learning classifier system.
Add a description, image, and links to the lcs topic page so that developers can more easily learn about it.
To associate your repository with the lcs topic, visit your repo's landing page and select "manage topics."