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 193 / 198 1000
Repeated string 108 / 134 1100
Compare substring 78 / 103 1200
Palindrome substring 2 66 / 84 1200
String combinations 41 / 46 1200
Frequent substring 57 / 61 1200
Good pairs 32 / 36 1300
String rotation 53 / 59 1300
Bit reversing 20 / 25 1400
Repeated string 2 7 / 22 1900