# Leetcode Implement strStr() problem solution

In this Leetcode Implement strStr() problem solution Implement strStr(). Return the index of the first occurrence of needle in a haystack, or -1 if the needle is not part of the haystack.

## Problem solution in Python.

```class Solution:
def strStr(self, haystack: str, needle: str) -> int:
try:
return 0 if len(needle) == 0 else haystack.index(needle, 0, len(haystack))
except:
return -1
```

## Problem solution in Java.

```class Solution {
public int strStr(String haystack, String needle) {
return haystack.indexOf(needle);
}
}
```

## Problem solution in C++.

```class Solution {
public:
int strStr(string haystack, string needle)
{
if(needle==" ")
return 0;
if(haystack.find(needle)!=string::npos)
return haystack.find(needle);
return -1;
}
};
```

## Problem solution in C.

```int strStr(char * haystack, char * needle)
{
int len = strlen(haystack),j;
int l=strlen(needle);

if(l==0)
return 0;

if(len<l)
return -1;

for(int i=0;i<len;i++)
{
for(j=0;j<l;j++)
{
if(haystack[i+j]!=needle[j])
break;
}
if(j==l)
return i;
}
return -1;
}
```