Скачать или смотреть LeetCode 28 | Find the Index of the First Occurrence in a String | Python | AlgoYogi

Welcome to AlgoYogi!

🚀 Start Your Smart Coding Prep at 👉 https://algoyogi.io

In this video, we solve *LeetCode 28: Find the Index of the First Occurrence in a String* using Python and a straightforward substring-search approach.
Given two strings, `haystack` and `needle`, return the index of the first occurrence of `needle` in `haystack`, or -1 if it doesn’t appear. :contentReference[oaicite:1]{index=1}

Approach:
Compute lengths `m = len(needle)` and `n = len(haystack)`.
Iterate `i` from `0` to `n − m` (inclusive).
At each `i`, check `haystack[i : i + m] == needle`. If true, return `i`.
If no match found, return -1.

👉 Problem Link: https://leetcode.com/problems/find-th...

---

⏱ Timestamps
0:00 Introduction
0:20 Problem Statement
0:40 Sliding Window / Substring Approach
7:00 Python Code Walkthrough
11:30 Time & Space Complexity

---

💡 Why Watch?
Clean, easy to understand substring search in Python
Solid interview-warm up with string patterns
Prepares you for more advanced algorithms like KMP or Rabin-Karp if needed, but this simple method works for most cases :contentReference[oaicite:2]{index=2}

#LeetCode #strStr #Python #AlgoYogi #SubstringSearch