1 public class Solution { 2     public int strStr(String haystack, String needle) { 3         int stacklen=haystack.length(); 4         int needlelen=needle.length(); 5         int j=0; 6         if(needlelen==0&&stacklen==0)return 0; 7         if(needlelen==0&&stacklen!=0) return 0; 8         if(needlelen>stacklen) return -1; 9         for(int i=0;i<=stacklen-needlelen;i++){10             int tmp=i;11             for(j=0;j<needlelen;j++){12                 if(needle.charAt(j)!=haystack.charAt(tmp)) break;13                 tmp++;14             }15             if(j==needlelen) return i;16         }17         return -1;18     }19 }

O(nm) runtime, O(1) space – Brute force:You could demonstrate to your interviewer that this problem can be solved using known efficient algorithms such as Rabin-Karp algorithm, KMP algorithm, and the Boyer- Moore algorithm. Since these algorithms are usually studied in an advanced algorithms class, it is sufficient to solve it using the most direct method in an interview – The brute force method.The brute force method is straightforward to implement. We scan the needle with the haystack from its first position and start matching all subsequent letters one by one. If one of the letters does not match, we start over again with the next position in the haystack.The key is to implement the solution cleanly without dealing with each edge case separately.