Pocket Gems interview question
Design strstr
Interview Answer
Anonymous
24 July 2012
No need of KMP or any other difficult algorithms. Just give the code for O(n^2) algorithm.
Design strstr
Anonymous
No need of KMP or any other difficult algorithms. Just give the code for O(n^2) algorithm.
Check out your Company Bowl for anonymous work chats.