First version of the Implement Strstr problem. Naive approach, time complexity is O(mn), where m and n are the length of haystack and needle, respectively.