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 634 / 669 1000
Repeated string 377 / 454 1100
Compare substring 322 / 379 1200
Palindrome substring 2 265 / 332 1200
String combinations 191 / 211 1200
Frequent substring 217 / 240 1200
Good pairs 148 / 170 1300
String rotation 175 / 200 1300
Bit reversing 78 / 86 1400
Repeated string 2 50 / 103 1900