public class Solution {
    public int strStr(String haystack, String needle) {
        
        for(int i = 0; i <= haystack.length()-needle.length();i++)
        {
            int j;
            for(j = 0 ; j < needle.length();j++)
            {
                if(haystack.charAt(i+j) != needle.charAt(j))
                break;
            }
            
            if(j == needle.length()) return i;
        }
       // return haystack.indexOf(needle);           
       return -1;
    }
}