Question: Modify the Rabin-Karp algorithm to search for a given pattern with the additional proviso that some character in the pattern is a wildcard, that is

Modify the Rabin-Karp algorithm to search for a given pattern with the additional proviso that some character in the pattern is a wildcard, that is it can be any character. So, for some k = 0, 1, .., M - 1, where the length of the pattern is M, the kth character of the pattern can be any character. You may assume that k is given as input along with the text and pattern
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
