Every story and comment from the Hacker News API, in a layout borrowed from 2001.
A comment on Ask HN: I just wrote an O(N) diffing algorithm – what am I missing?. Parent comment
ABXCDYEFGZ QARBCSTDEFG
You want to find [Q]A[R]B(X)C[ST]D(Y)EFG(Z)
ABCDEFG is the longest common subsequence, QRST are the additions and XYZ are the deletions.
There are no comments on this comment yet.
ABXCDYEFGZ QARBCSTDEFG
You want to find [Q]A[R]B(X)C[ST]D(Y)EFG(Z)
ABCDEFG is the longest common subsequence, QRST are the additions and XYZ are the deletions.