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 444 / 456 1000
Repeated string 260 / 317 1100
Compare substring 206 / 251 1200
Palindrome substring 2 175 / 223 1200
String combinations 126 / 142 1200
Frequent substring 152 / 170 1200
Good pairs 107 / 116 1300
String rotation 133 / 153 1300
Bit reversing 52 / 60 1400
Repeated string 2 39 / 69 1900