Course contentsShow
Computer Science
Lesson 412 of 2,87210. Hash TablesPro lesson

Polynomial Rolling Hash for Strings

Computing string hashes as polynomial evaluations: h(s) = s[0]*p^(n-1) + s[1]*p^(n-2) + ... + s[n-1].

This lesson is for subscribers

You've completed the free preview. Subscribe to unlock every lesson in every course.