LeetCode 1062: Longest Repeating Substring
A clear explanation of finding the longest substring that appears at least twice using binary search on length with rolling hash.
Tag
Rolling-Hash
5 notes
LeetCode 1044: Longest Duplicate Substring
A clear explanation of finding the longest duplicate substring using binary search on length combined with Rabin-Karp rolling hash.
LeetCode 187: Repeated DNA Sequences
A clear explanation of finding repeated 10-letter DNA substrings using a fixed-size sliding window and hash sets.
Rolling Hash Search
Search for a pattern in a sequence by maintaining a hash over a sliding window.
5.11 Rolling Hashes
Compute hash values for sliding windows over a sequence in constant time by incrementally updating rather than recomputing.