Question

The Rabin-Karp algorithm uses which technique to efficiently compare substrings?

Q: Answer-The Rabin-Karp algorithm uses which technique to efficiently compare substrings?

The Rabin-Karp algorithm uses hashing to quickly filter out positions in the text that are unlikely to match the pattern. It computes a hash value for the pattern and then computes hash values for all possible substrings of the text of the same length as the pattern. If the hash values match, it then performs a character-by-character comparison to confirm a true match to handle hash collisions.