Domanda di colloquio di Pocket Gems
Design strstr
Risposta di colloquio
Anonimo
24 lug 2012
No need of KMP or any other difficult algorithms. Just give the code for O(n^2) algorithm.
Design strstr
Anonimo
No need of KMP or any other difficult algorithms. Just give the code for O(n^2) algorithm.