Find the Index of the First Occurrence in a String | Leetcode #28

This video explains finding the needle in haystack problem which is a standard pattern matching problem and can be solved optimally using KMP algorithm or Rolling Hash which is the Rabin Karp Algorithm.
----------------------------------------------------------------------------------------------------------------------------------------------------------------
🟣 JOIN our 𝐋𝐈𝐕𝐄 𝐢𝐧𝐭𝐞𝐫𝐯𝐢𝐞𝐰 𝐭𝐫𝐚𝐢𝐧𝐢𝐧𝐠 𝐩𝐫𝐨𝐠𝐫𝐚𝐦 through whatsapp query: +91 8918633037
🟣 𝐂𝐡𝐞𝐜𝐤𝐨𝐮𝐭 𝐚𝐥𝐥 𝐨𝐮𝐫 𝐂𝐨𝐮𝐫𝐬𝐞𝐬: techdose.co.in/
🔵 LinkedIn: / surya-pratap-kahar
🔴 INSTAGRAM: / techdose_official
🟢 𝐓𝐞𝐜𝐡𝐝𝐨𝐬𝐞-𝟏𝟎𝟎 𝐬𝐡𝐞𝐞𝐭: docs.google.com/spreadsheets/...
---------------------------------------------------------------------------------------------------------------------------------------------------------------
KMP Algo: • KMP algorithm | Patter...
Rolling Hash: • Rolling hash | Rabin k...
𝐂𝐎𝐃𝐄 𝐋𝐈𝐍𝐊: gist.github.com/SuryaPratapK/...

Пікірлер: 2

  • @dibyendughosh4641
    @dibyendughosh464120 күн бұрын

    complexity of explanation is high

  • @user-to5ec1pr4e
    @user-to5ec1pr4e3 ай бұрын

    Awesome 🙌