dsa2 min read
Longest Duplicate Substring [Hard] — Binary Search + Rolling Hash
Find the longest substring that appears at least twice using binary search on length and Rabin-Karp rolling hash for O(n log n) average time.
Read →
Rabin-karp
2 articles
dsa2 min read
Rabin-Karp — Rolling Hash for Pattern Matching and Substring Search
Rabin-Karp uses a rolling polynomial hash to match patterns in O(n+m) expected time. The key is updating the hash in O(1) as the window slides.
Read →