Problem Statement
Find first occurrence of needle in haystack.
Approach
Sliding window comparison. Or KMP for O(n+m).
Time & Space Complexity
Time O(n×m) naive, O(n+m) KMP.

The DSA Visualizer is designed for deep focus,
side-by-side code, and real-time execution insight.
On small screens, that level of clarity can't be preserved.
Open on a tablet (landscape) or desktop for the intended experience.
Desktop experience preview
Find substring in string.
Find first occurrence of needle in haystack.
Sliding window comparison. Or KMP for O(n+m).
Time O(n×m) naive, O(n+m) KMP.
Loading Interactive Visualizer...
Click "Play" or use arrow keys to step through the execution.