Pregunta de entrevista de Meta
Given a large string (haystack), find a substring (needle) on it.
Respuesta de la entrevista
Anónimo
3 de abr de 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.