KMP String Matching

Category: Advanced

Difficulty: advanced

Description: Linear time pattern matching

Time Complexity: O(n+m)

Space Complexity: O(m)

Related LeetCode Problems

• 28. Find the Index of the First Occurrence in a String (Easy)
• 214. Shortest Palindrome (Hard)
• 459. Repeated Substring Pattern (Easy)
• 17. Letter Combinations of a Phone Number (Medium)
• 686. Repeated String Match (related matching) (Medium)
• 28. strStr() (duplicate) (Easy)