Skip to content

Longest Common Subsequence algorithm in Python

wordaligned.org
41 pointswhite_eskimo1 comment
On HN

Comments

It's a really nice breakdown of sub-sequence calculation methods. If you're doing a letter-perfect diff calculation, or need to know how "different" two strings are, this is what you need. It even includes code and explanations of the code and how it all works.

All in all, the post is roughly worth a couple algorithm class sessions. Worth the read for just about anyone, if only for picking up a few new logical tricks.

AboutSource Built by g1lg1l

Hackerly is an independent reader for Hacker News, built on the public HN API. Not affiliated with Y Combinator.