Empresa engajada
Write a function to search for a string within another string. Analyze it's complexity, and propose optimizations.
Sigiloso
Represent the string in Suffix Tree and u can find the pattern in O(m) time.
Use Boyer-moore algorithm.
@jimmy thanks http://www.movsd.com/bm.htm
I wonder if you had to code BM algorithm during the interview. That would be... hard...
Use Robin-karp or KMP algorithm
Fique por dentro de todas as oportunidades e dicas internas seguindo as empresas de seus sonhos.
Comece a buscar vagas para receber atualizações e recomendações personalizadas.