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 600 / 628 1000
Repeated string 357 / 432 1100
Compare substring 302 / 357 1200
Palindrome substring 2 251 / 315 1200
String combinations 185 / 202 1200
Frequent substring 209 / 231 1200
Good pairs 144 / 165 1300
String rotation 171 / 195 1300
Bit reversing 76 / 83 1400
Repeated string 2 49 / 97 1900