I recently had an interview question that went something like this: Given a large string (haystack), find a substring (needle)? I was a little stumped to come up with a decent solution. What is the best way to approach this that doesn't have a poor time complexity?