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 487 / 500 1000
Repeated string 285 / 348 1100
Compare substring 233 / 281 1200
Palindrome substring 2 198 / 252 1200
String combinations 147 / 162 1200
Frequent substring 173 / 191 1200
Good pairs 121 / 130 1300
String rotation 147 / 169 1300
Bit reversing 64 / 71 1400
Repeated string 2 42 / 78 1900