How do you make a rolling hash safe against collisions?

A strong answer

A strong candidate frames How do you make a rolling hash safe against collisions? around the exact memory layout, compiler semantics, and hardware execution model covered in Rolling hash and Rabin-Karp. Explain polynomial rolling hashes, why collisions happen, and how base, modulus and verification control them.

The obvious way to find a pattern of length m in a text of length n compares the pattern against every window of the text, character by character. Most windows fail within a character or two, but for inputs such as a text of all a's and a pattern of a's ending in b, every window compares nearly m characters, for O(n × m) in the worst case.

Michael Rabin and Richard Karp's idea, from 1987, is to compare numbers instead. Turn the pattern into a hash, a number, once. Turn each window of the text into a hash too, and compare the hashes. Unequal hashes prove the strings differ, so most windows are rejected with one comparison. Equal hashes mean the strings are probably equal, so only then are the characters checked.

In a production interview, always connect the specification rule to its concrete runtime consequence: state what lives on the stack versus the heap or static storage segment, how the compiler or operating system validates alignments, lifetimes, and error codes, and what happens under adversarial or boundary inputs (such as zero-length buffers, integer overflow, concurrent mutation, or partial I/O). Backing your explanation with a small trace of register/memory state transitions immediately separates senior systems engineers from candidates who only memorized syntax.

What the interviewer is listening for

• Mastery of core invariant: Compute a polynomial hash of a string and roll it across a window in O(1) per step.
• Mastery of core invariant: Find pattern occurrences with Rabin-Karp, verifying hash matches to rule out collisions.
• Mastery of core invariant: Choose the base and modulus, and combine rolling hashes with binary search for substring problems.
• Hardware and ABI awareness: Explaining how sizes, alignments, calling conventions, or kernel boundaries behave on real 64-bit targets rather than relying on implementation-defined assumptions.
• Defensive engineering: Naming the exact compiler flags (-Wall -Wextra -Werror), static analyzers, or runtime sanitizers (-fsanitize=address,undefined,thread) that verify correctness in CI.

Common mistakes

• Explaining only surface syntax without tracing the underlying memory addresses, ownership lifetime, or kernel/user-space state transitions.
• Assuming undefined behavior (such as signed overflow, uninitialized reads, strict-aliasing violations, or dangling pointers) will "just work" because it passed an unoptimized -O0 debug build.
• Ignoring return codes, partial reads/writes, alignment padding, or cleanup paths when an allocation or syscall fails midway through a function.