Rolling hash is a neat idea found in the Rabin-Karp string matching algorithm which is easy to grasp and useful in quite a few different contexts.

As before, the most interesting part of the article is the problem section. You can discuss them in the comment section, but first let's go through a few applications.

As before, the most interesting part of the article is the problem section, but first let's go through a few applications.

h2. The Rabin-Karp algorithm