Write a function to search for a string within another string. Analyze it's complexity, and propose optimizations.
Anonymous
Represent the string in Suffix Tree and u can find the pattern in O(m) time.
Check out your Company Bowl for anonymous work chats.