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 296 / 303 1000
Repeated string 165 / 202 1100
Compare substring 127 / 163 1200
Palindrome substring 2 104 / 139 1200
String combinations 73 / 84 1200
Frequent substring 95 / 108 1200
Good pairs 58 / 67 1300
String rotation 76 / 93 1300
Bit reversing 30 / 37 1400
Repeated string 2 18 / 38 1900