: Greedy algorithms, dynamic programming, and pattern matching (e.g., Knuth-Morris-Pratt). Key Strengths and Limitations
Faster and more memory-efficient than standard arrays when the size of the data set is known in advance. : Greedy algorithms