ConceptTheory & Algos
Rolling hash
A data structure that maintains a hash value for a moving substring, allowing the hash of the next substring to be computed quickly from the previous one.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Lecturers
1Connections
3The lectures that define it or assume it, and the concepts next to it.