Knuth–Morris–Pratt KMP - Find the Index of the First Occurrence in a String - Leetcode 28 - Python
NeetCode NeetCode
820K subscribers
117,830 views
3.2K

 Published On Nov 14, 2021

🚀 https://neetcode.io/ - A better way to prepare for Coding Interviews

🥷 Discord:   / discord  
🐦 Twitter:   / neetcode1  

🐮 Support the channel:   / neetcode  

CODE ON GITHUB: https://github.com/neetcode-gh/leetco...

⭐ BLIND-75 PLAYLIST:    • Two Sum - Leetcode 1 - HashMap - Python  
💡 CODING SOLUTIONS:    • Coding Interview Solutions  
💡 DYNAMIC PROGRAMMING PLAYLIST:    • House Robber -  Leetcode 198 - Python...  
🌲 TREE PLAYLIST:    • Invert Binary Tree - Depth First Sear...  
💡 GRAPH PLAYLIST:    • Course Schedule - Graph Adjacency Lis...  
💡 BACKTRACKING PLAYLIST:    • Word Search - Backtracking - Leetcode...  
💡 LINKED LIST PLAYLIST:    • Reverse Linked List - Iterative AND R...  
💡 BINARY SEARCH PLAYLIST:    • Binary Search  
📚 STACK PLAYLIST:    • Stack Problems  

Problem Link: https://leetcode.com/problems/impleme...

0:00 - Read the problem
1:00 - Review Brute Force O(n * m)
3:45 - Motivation for KMP
5:25 - Understanding LPS
9:15 - Coding LPS
26:35 - Coding KMP

leetcode 28
This question was identified as an interview question from here: https://github.com/xizhengszhang/Leet...


#kmp #knuth-morris-pratt #python
Disclosure: Some of the links above may be affiliate links, from which I may earn a small commission.

show more

Share/Embed