Computer scienceAlgorithms and data structuresAlgorithmsString algorithmsSubstring search algorithms

Rolling hash

Rolling hashing

Report a typo

What statements below about the rolling hash property are correct?

Select one or more options from the list

The linear hash function is a rolling hash since a hash value for this function does not depend on the order of symbols in a string.

If a hash function is a rolling hash, then it does not have collisions.

The polynomial hash function is a rolling hash since if we know a hash value for a substring, it is possible to calculate a hash value for a neighboring substring in

O(1)

The polynomial hash function is not a rolling hash since a hash value for this function depends on the order of symbols in a string.

Create a free account to access the full topic