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 465 / 478 1000
Repeated string 278 / 336 1100
Compare substring 225 / 271 1200
Palindrome substring 2 189 / 242 1200
String combinations 142 / 157 1200
Frequent substring 163 / 182 1200
Good pairs 115 / 124 1300
String rotation 143 / 165 1300
Bit reversing 63 / 70 1400
Repeated string 2 41 / 77 1900