SwiftLCS | Swift implementation of the longest common subsequence | Learning library

SwiftLCS is a Swift library typically used in Tutorial, Learning, Example Codes applications. SwiftLCS has no bugs, it has no vulnerabilities, it has a Permissive License and it has low support. You can download it from GitHub.

SwitLCS provides an extension of Collection that finds the indexes of the longest common subsequence with another collection. The longest common subsequence (LCS) problem is the problem of finding the longest subsequence common to all sequences in a set of sequences (often just two sequences). It differs from problems of finding common substrings: unlike substrings, subsequences are not required to occupy consecutive positions within the original sequences. The project is based on the Objective-C implementation of NSArray+LongestCommonSubsequence.