# Find the Index of the First Occurrence in a String Leetcode Solution

In this post, we are going to solve the Find the Index of the First Occurrence in a String Leetcode Solution problem of Leetcode. This Leetcode problem is done in many programming languages like C++, Java, and Python.

## Problem

Given two strings `needle` and `haystack`, return the index of the first occurrence of `needle` in `haystack`, or `-1` if `needle` is not part of `haystack`.

Example 1:

```Input: haystack = "sadbutsad", needle = "sad"
Output: 0
Explanation: "sad" occurs at index 0 and 6.
The first occurrence is at index 0, so we return 0.
```

Example 2:

```Input: haystack = "leetcode", needle = "leeto"
Output: -1
Explanation: "leeto" did not occur in "leetcode", so we return -1.
```

Constraints:

• `1 <= haystack.length, needle.length <= 104`
• `haystack` and `needle` consist of only lowercase English characters.

Now, lets see the leetcode solution of Find the Index of the First Occurrence in a String Leetcode Solution.

### Find the Index of the First Occurrence in a String Leetcode Solution in Python

```class Solution:
def strStr(self, haystack: str, needle: str) -> int:
m = len(haystack)
n = len(needle)

for i in range(m - n + 1):
if haystack[i:i + n] == needle:
return i

return -1
```

### Find the Index of the First Occurrence in a StringLeetcode Solutionin CPP

```class Solution {
public:
int strStr(string haystack, string needle) {
const int m = haystack.length();
const int n = needle.length();

for (int i = 0; i < m - n + 1; i++)
if (haystack.substr(i, n) == needle)
return i;

return -1;
}
};
```

### Find the Index of the First Occurrence in a String Leetcode Solution in Java

```class Solution {
public int strStr(String haystack, String needle) {
final int m = haystack.length();
final int n = needle.length();

for (int i = 0; i < m - n + 1; ++i)
if (haystack.substring(i, i + n).equals(needle))
return i;

return -1;
}
}
```

Note: This problem Find the Index of the First Occurrence in a String is generated by Leetcode but the solution is provided by Chase2learn This tutorial is only for Educational and Learning purposes.

Sharing Is Caring