4 ms·
> can be gamed heavily by just memorizing a dynamic-programming solution to the longest-common-subsequence problem; Funny, I actually implemented this about a
by flukus 10y ago
> can be gamed heavily by just memorizing a dynamic-programming solution to the longest-common-subsequence problem;
Funny, I actually implemented this about a month ago but I can't remember how it works now.