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 660 / 697 1000
Repeated string 393 / 470 1100
Compare substring 335 / 394 1200
Palindrome substring 2 277 / 345 1200
String combinations 198 / 221 1200
Frequent substring 224 / 247 1200
Good pairs 154 / 176 1300
String rotation 181 / 206 1300
Bit reversing 81 / 90 1400
Repeated string 2 54 / 107 1900