# Find The Index Of The First Occurrence In A String: Explained

Find The Index Of The First Occurrence In A String shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Return the first index where needle occurs in haystack, or -1. A linear scan with slicing or a two-pointer match is fine at interview length; KMP is the linear-guaranteed version.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n*m) naive or O(n+m) KMP.

## Common mistake

Using language find() without being able to explain it, or returning any occurrence rather than the first.

## Practice tip

Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at Linkjob.