Rabin Karp String Matching in DSA C++ - Cheat Sheet & Quick Revision

Recall & Review

beginner

What is the main idea behind the Rabin Karp string matching algorithm?

It uses hashing to find a pattern in a text by comparing hash values of the pattern and substrings of the text, reducing the number of direct character comparisons.

intermediate

Why does Rabin Karp use a rolling hash?

A rolling hash allows efficient calculation of the hash value for the next substring by updating the previous hash, avoiding recomputing from scratch.

intermediate

What happens if two substrings have the same hash value in Rabin Karp?

Since hash collisions can occur, the algorithm performs a direct character-by-character check to confirm if the substrings actually match.

advanced

What is the average and worst-case time complexity of Rabin Karp?

Average case: O(n + m) where n is text length and m is pattern length. Worst case: O(n*m) due to hash collisions causing many character checks.

intermediate

What role does the modulus play in Rabin Karp hashing?

The modulus keeps hash values within a fixed range to avoid overflow and helps in spreading hash values uniformly to reduce collisions.

What does Rabin Karp primarily use to speed up pattern searching?

A Sorting the text

B Binary search

C Hashing of substrings

D Brute force comparison

Rabin Karp uses hashing to quickly compare substrings instead of checking each character directly.

What is a rolling hash in Rabin Karp?

A A hash that is recalculated from scratch every time

B A hash that updates efficiently when moving to the next substring

C A hash that sorts the substring characters

D A hash that ignores the last character

Rolling hash updates the hash value by removing the old character and adding the new one efficiently.

If two substrings have the same hash, what does Rabin Karp do next?

A Performs character-by-character comparison

B Ignores the substrings

C Directly returns a match

D Recomputes the hash

Because of possible hash collisions, Rabin Karp verifies by comparing characters directly.

What is the worst-case time complexity of Rabin Karp?

A O(n * m)

B O(n log m)

C O(n + m)

D O(m^2)

In the worst case, many hash collisions cause Rabin Karp to do character comparisons for each substring, leading to O(n*m).

Why is modulus used in Rabin Karp hashing?

A To sort the hash values

B To ignore certain characters

C To increase hash values exponentially

D To keep hash values in a fixed range and reduce collisions

Modulus keeps hash values manageable and helps distribute them evenly to reduce collisions.

Explain how Rabin Karp uses hashing and rolling hash to find a pattern in a text.

Think about how hash values help avoid checking every character every time.

Describe the time complexity of Rabin Karp and why it can degrade to worst case.

Consider what happens when many substrings share the same hash.

Practice

1. What is the main idea behind the Rabin Karp String Matching algorithm?

easy

A. Compare each character one by one without hashing

B. Use hashing to find pattern matches efficiently

C. Sort the text and pattern before matching

D. Use recursion to find all pattern occurrences

Solution

1. Step 1: Understand Rabin Karp's approach

   The algorithm uses a hash function to convert the pattern and text substrings into numbers.

2. Step 2: Use hashing for efficient matching

   By comparing hash values instead of characters, it quickly finds potential matches and then verifies them.

3. Final Answer:

   Use hashing to find pattern matches efficiently -> Option B

4. Quick Check:

   Hashing = Efficient matching [OK]

Hint: Remember: Rabin Karp uses hashing for fast pattern search [OK]

Common Mistakes:

• Thinking it compares characters directly always
• Assuming it sorts strings before matching
• Confusing it with recursive search methods

2. Which of the following is the correct way to update the rolling hash in Rabin Karp when moving from substring s[i..i+m-1] to s[i+1..i+m]?

easy

A. Add leftmost char's hash, multiply by base, subtract new char's hash

B. Multiply entire hash by base and add new char's hash only

C. Remove leftmost char's hash, multiply by base, add new char's hash

D. Recalculate hash from scratch for new substring

Solution

1. Step 1: Understand rolling hash update

   Remove the leftmost character's contribution, multiply remaining hash by base, then add new character's value.

2. Step 2: Apply formula for next substring

   This keeps hash calculation efficient without recomputing from scratch.

3. Final Answer:

   Remove leftmost char's hash, multiply by base, add new char's hash -> Option C

4. Quick Check:

   Rolling hash update = Remove + multiply + add [OK]

Hint: Rolling hash = remove old char + shift + add new char [OK]

Common Mistakes:

• Recalculating hash fully each time
• Adding instead of removing old char's hash
• Multiplying after adding new char instead of before

3. What will be the output of the following C++ code snippet using Rabin Karp to find pattern "abc" in text "ababc"?

std::string text = "ababc";
std::string pattern = "abc";
// Assume correct Rabin Karp implementation
std::vector<int> matches = rabinKarpSearch(text, pattern);
for (int pos : matches) std::cout << pos << " ";

medium

A. 1

B. 0 2

C. No output

D. 2

Solution

1. Step 1: Identify pattern occurrences in text

   Pattern "abc" appears starting at index 2 in "ababc" (0-based indexing).

2. Step 2: Confirm no other matches

   Substring at index 0 is "aba", not "abc"; index 1 is "bab", not "abc".

3. Final Answer:

   2 -> Option D

4. Quick Check:

   Pattern found at index 2 [OK]

Hint: Check substring positions carefully for exact matches [OK]

Common Mistakes:

• Assuming match at index 0 incorrectly
• Confusing overlapping substrings
• Using 1-based indexing instead of 0-based

4. Identify the bug in this Rabin Karp rolling hash update snippet:

hash = (hash - text[i] * pow(base, m-1)) * base + text[i+m];

What is the likely problem?

medium

A. Missing modulo operation causing overflow

B. Wrong power used in subtraction term

C. Adding instead of subtracting old char's hash

D. Incorrect base multiplier order

Solution

1. Step 1: Check arithmetic operations in rolling hash

   The formula subtracts old char's hash, multiplies by base, adds new char's value.

2. Step 2: Identify missing modulo usage

   Without modulo, hash values can overflow integer limits causing wrong results.

3. Final Answer:

   Missing modulo operation causing overflow -> Option A

4. Quick Check:

   Modulo needed to prevent overflow [OK]

Hint: Always apply modulo after each hash update [OK]

Common Mistakes:

• Ignoring modulo leading to wrong hash values
• Using wrong power exponent
• Mixing addition and subtraction signs

5. Given a large text and multiple patterns, how can Rabin Karp be adapted to efficiently find all pattern occurrences?

hard

A. Use a combined hash set of all patterns and check text substrings against it

B. Run Rabin Karp separately for each pattern on the entire text

C. Sort all patterns and use binary search on text substrings

D. Use recursion to match patterns one by one

Solution

1. Step 1: Understand multi-pattern matching challenge

   Running Rabin Karp separately for each pattern is inefficient for many patterns.

2. Step 2: Use combined hashing approach

   Hash all patterns and store in a set. Then slide over text, hashing substrings and checking set membership.

3. Step 3: Efficiently find all matches

   This reduces repeated work and speeds up multi-pattern search.

4. Final Answer:

   Use a combined hash set of all patterns and check text substrings against it -> Option A

5. Quick Check:

   Combined hashing = efficient multi-pattern search [OK]

Hint: Hash all patterns once, then check text substrings [OK]

Common Mistakes:

• Running separate searches for each pattern
• Sorting patterns instead of hashing
• Using recursion unnecessarily