Rabin–Karp string matching ⚡

While exploring about hash functions, I came across an interesting algorithm: Rabin–Karp string matching ⚡

Did you know? Editors like VSCode (or any text search) often use this to find patterns in O(n + m) time instead of O(n·m) brute force.

• n → text length

• m → pattern length

https://github.com/coderj001/CodeADay/blob/master/C%2B%2B/MultiPatternSearch/src/MultiPatternSearch.cpp