4 ms·
The straightforward solution is: For each fake title, compute its Hamming distance to every real title. Filter titles whose distances are very close to real ti
by sillysaurus2 13y ago
The straightforward solution is: For each fake title, compute its Hamming distance to every real title. Filter titles whose distances are very close to real titles.
It's O(N^2), but if you write it in Python and run it with pypy, performance may be acceptable. Maybe.
But I think this is a classic example of a Problem That Doesn't Matter. No need to spend time solving it (unless you're having fun!)