# Rolling Hash With Double Modulus: Explained

Rolling Hash With Double Modulus shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Maintain two polynomial hashes under different primes so a collision needs to happen in both at once.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n) preprocessing, O(1) per substring hash.

## Common mistake

Comparing hashes without verifying, and picking a base smaller than the alphabet.

## Practice tip

Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at Linkjob.ai.