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 265 / 271 1000
Repeated string 150 / 184 1100
Compare substring 115 / 148 1200
Palindrome substring 2 92 / 121 1200
String combinations 62 / 71 1200
Frequent substring 81 / 88 1200
Good pairs 49 / 57 1300
String rotation 69 / 83 1300
Bit reversing 30 / 37 1400
Repeated string 2 13 / 32 1900