<p>Given two strings <code>needle</code> and <code>haystack</code>, return the index of the first occurrence of <code>needle</code> in <code>haystack</code>, or <code>-1</code> if <code>needle</code> is not part of <code>haystack</code>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> haystack = &quot;sadbutsad&quot;, needle = &quot;sad&quot;
<strong>Output:</strong> 0
<strong>Explanation:</strong> &quot;sad&quot; occurs at index 0 and 6.
The first occurrence is at index 0, so we return 0.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> haystack = &quot;leetcode&quot;, needle = &quot;leeto&quot;
<strong>Output:</strong> -1
<strong>Explanation:</strong> &quot;leeto&quot; did not occur in &quot;leetcode&quot;, so we return -1.
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= haystack.length, needle.length &lt;= 10<sup>4</sup></code></li>
	<li><code>haystack</code> and <code>needle</code> consist of only lowercase English characters.</li>
</ul>

class Solution {
public:
    int strStr(string haystack, string needle) {
          
int haystackLen = haystack.length();
    int needleLen = needle.length();

    // Edge case: Empty needle
    if (needleLen == 0) return 0;

    // Edge case: Needle longer than haystack
    if (haystackLen < needleLen) return -1;

    int i = 0;  // Pointer for haystack
    int j = 0;  // Pointer for needle

    while (i < haystackLen) {
        if (haystack[i] == needle[j]) {
            j++;
            i++;
            if (j == needleLen) {
                return i - j ;  // Found the needle, return starting index
            }
        
        }
         else {
            // Reset needle pointer and adjust haystack pointer
            i = i - j+1;
            j = 0;
        }
       
    }

    // Needle not found
    return -1;
    }
};
7900