Recall that the suffix array is a sorted array of all suffixes of a string, and its construction can be optimized using the DC3 algorithm for linear time.

For pattern matching, leverage the suffix array to perform binary search on the sorted suffixes, comparing the pattern with suffixes in logarithmic time.

Implement the Kasai algorithm to compute the LCP (Longest Common Prefix) array in linear time, which can further optimize pattern matching by skipping unnecessary comparisons.