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 389 / 399 1000
Repeated string 215 / 270 1100
Compare substring 165 / 209 1200
Palindrome substring 2 142 / 186 1200
String combinations 98 / 111 1200
Frequent substring 122 / 138 1200
Good pairs 80 / 90 1300
String rotation 100 / 117 1300
Bit reversing 40 / 48 1400
Repeated string 2 28 / 54 1900