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 363 / 373 1000
Repeated string 202 / 254 1100
Compare substring 154 / 198 1200
Palindrome substring 2 129 / 168 1200
String combinations 90 / 101 1200
Frequent substring 113 / 128 1200
Good pairs 74 / 82 1300
String rotation 92 / 109 1300
Bit reversing 35 / 42 1400
Repeated string 2 24 / 50 1900