Frage im Vorstellungsgespräch bei Meta
Given a large string (haystack), find a substring (needle) on it.
Antwort im Vorstellungsgespräch
Anonym
3. Apr. 2010
The Knuth-Morris-Pratt algorithm does it in O(N+M), where N and M are the sizes of the two strings. However, it is quite hard to code from scratch.