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 514 / 529 1000
Repeated string 298 / 364 1100
Compare substring 253 / 305 1200
Palindrome substring 2 212 / 270 1200
String combinations 159 / 174 1200
Frequent substring 184 / 203 1200
Good pairs 127 / 140 1300
String rotation 156 / 180 1300
Bit reversing 65 / 72 1400
Repeated string 2 44 / 79 1900