Computer scienceAlgorithms and data structuresAlgorithmsString algorithmsSubstring search algorithms

Knuth-Morris-Pratt algorithm

Handy structure

Report a typo

Skipping the unnecessary comparisons in KMP algorithm is possible thanks to a familiar concept. Which one?

Select one option from the list

Prefix function

Rolling hash

Reverse string

Divide and conquer

Create a free account to access the full topic