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 604 / 631 1000
Repeated string 358 / 433 1100
Compare substring 303 / 359 1200
Palindrome substring 2 252 / 316 1200
String combinations 187 / 204 1200
Frequent substring 210 / 232 1200
Good pairs 145 / 166 1300
String rotation 172 / 196 1300
Bit reversing 76 / 83 1400
Repeated string 2 49 / 97 1900