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 455 / 468 1000
Repeated string 266 / 325 1100
Compare substring 211 / 258 1200
Palindrome substring 2 179 / 231 1200
String combinations 130 / 145 1200
Frequent substring 156 / 175 1200
Good pairs 108 / 117 1300
String rotation 135 / 155 1300
Bit reversing 55 / 62 1400
Repeated string 2 40 / 71 1900