The tag has no wiki summary.

learn more… | top users | synonyms

2
votes
1answer
46 views

Find longest common substring using a rolling hash

The longest common substring (LCS) of two input strings $s,t$ is a common substring (in both of them) of maximum length. We can relax the constraints to generalize the problem: find a common substring ...