Practice
Learn
← Quit
0 / 0 correct
Algorithms
Hard
1 of 10
How does Rabin-Karp search for a pattern?
A
Build a suffix tree
B
Use binary search
C
Compare rolling hashes of each text window with the pattern's hash, verifying on matches
D
Compare character by character only