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 251 / 256 1000
Repeated string 145 / 175 1100
Compare substring 113 / 144 1200
Palindrome substring 2 90 / 114 1200
String combinations 60 / 68 1200
Frequent substring 77 / 84 1200
Good pairs 47 / 54 1300
String rotation 69 / 82 1300
Bit reversing 30 / 36 1400
Repeated string 2 13 / 32 1900