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. Discuss them in the comment section, but first let's go through a few applications.

h2. The Rabin-Karp algorithm

h2. Largest palindrome

bq. Given a string of length n, find out it's largest palindromic substring.

bq. Given a string of length n, find out its largest palindromic substring.

The naive solution is O(n^3^). For every possible substring it tests in linear time if it's a palindrome.