UNPKG

@lachenmayer/longest-common-subsequence

Version:

Finds the longest common subsequence of two strings, and the diff between them.

21 lines (20 loc) 469 B
{ "name": "@lachenmayer/longest-common-subsequence", "version": "1.0.1", "description": "Finds the longest common subsequence of two strings, and the diff between them.", "author": "harry lachenmayer <harrylachenmayer@gmail.com>", "keywords": [ "strings", "lcs", "longest common subsequence", "diff" ], "license": "ISC", "main": "index.js", "scripts": { "test": "ava test.js" }, "devDependencies": { "ava": "^0.25.0" } }