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.
15 notes
A clear explanation of finding the longest substring that appears at least twice using binary search on length with rolling hash.
A clear explanation of finding the longest duplicate substring using binary search on length combined with Rabin-Karp rolling hash.
Construct a suffix array by sorting rank pairs with radix or counting sort during the doubling method.
Difference cover modulo 7 suffix array construction method that generalizes DC3 with a larger recursive sample.
Difference cover modulo 3 algorithm for linear-time suffix array construction using radix sorting and merging.
Linear-time suffix array construction using the DC3 algorithm that recursively sorts positions modulo 3.
Linear-time suffix array construction algorithm based on induced sorting of LMS suffixes.
Linear-time technique for suffix array construction that induces order of suffixes from a subset of sorted suffixes.
Construct a suffix array by iteratively sorting suffixes using doubling technique with rank pairs.
Linear time suffix array construction using induced sorting of LMS substrings.
Generalized divide and conquer suffix array construction using modulo 7 partitioning.
Linear time suffix array construction using the DC3 divide and conquer strategy.
Build a suffix array using the prefix doubling technique with iterative ranking.
Search for a pattern in a suffix array using LCP information to reduce redundant character comparisons.
Search for a pattern in a text by binary searching the lexicographically sorted suffix array.