LeetCode 187: Repeated DNA Sequences
A clear explanation of finding repeated 10-letter DNA substrings using a fixed-size sliding window and hash sets.
Tag
Rolling-Hash
3 notes
3 notes
A clear explanation of finding repeated 10-letter DNA substrings using a fixed-size sliding window and hash sets.
Search for a pattern in a sequence by maintaining a hash over a sliding window.
Compute hash values for sliding windows over a sequence in constant time by incrementally updating rather than recomputing.