Module String matching - Hash

String matching - Hash

**Frequency: 5/10** Used in string problems. You should focus on hash algorithm first.

Resources

- [CP Algorithms: String hashing](https://cp-algorithms.com/string/string-hashing.html) More on string matching: - [CP Algorithms: Prefix function. Knuth–Morris–Pratt algorithm](https://cp-algorithms.com/string/prefix-function.html)

Problems

String occurences 2 657 / 692 1000
Repeated string 391 / 469 1100
Compare substring 332 / 391 1200
Palindrome substring 2 274 / 342 1200
String combinations 197 / 218 1200
Frequent substring 222 / 245 1200
Good pairs 152 / 174 1300
String rotation 179 / 205 1300
Bit reversing 81 / 89 1400
Repeated string 2 54 / 107 1900