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 761 / 803 1000
Repeated string 464 / 546 1100
Compare substring 387 / 456 1200
Palindrome substring 2 309 / 387 1200
String combinations 225 / 250 1200
Frequent substring 253 / 278 1200
Good pairs 174 / 198 1300
String rotation 200 / 226 1300
Bit reversing 89 / 98 1400
Repeated string 2 61 / 121 1900