#### String matching is a fundamental concept in computer science, widely used in search engines, plagiarism detection, bioinformatics, and database searching. 
##### Following are some common patterns and algorithms on the same.

### Z Algorithm Related
1. [Implement strStr()](https://leetcode.com/problems/implement-strstr/)
2. [Repeated String Match](https://leetcode.com/problems/repeated-string-match/)
3. [Longest Happy Prefix](https://leetcode.com/problems/longest-happy-prefix/)
4. [Shortest Palindrome](https://leetcode.com/problems/shortest-palindrome/)
5. [Maximum Deletions on a String](https://leetcode.com/problems/maximum-deletions-on-a-string/)

### Rabin-Karp Related
1. [Repeated DNA Sequences](https://leetcode.com/problems/repeated-dna-sequences/)
2. [Find the Index of the First Occurrence in a String](https://leetcode.com/problems/find-the-index-of-the-first-occurrence-in-a-string/)
3. [Longest Duplicate Substring](https://leetcode.com/problems/longest-duplicate-substring/)
4. [Count the Repetitions](https://leetcode.com/problems/count-the-repetitions/)
5. [Distinct Echo Substrings](https://leetcode.com/problems/distinct-echo-substrings/)
6. [Substring with Concatenation of All Words](https://leetcode.com/problems/substring-with-concatenation-of-all-words/)
7. [Repeated String Match](https://leetcode.com/problems/repeated-string-match/)

### KMP Related
1. [Shortest Palindrome](https://leetcode.com/problems/shortest-palindrome/)
2. [Distinct Echo Substrings](https://leetcode.com/problems/distinct-echo-substrings/)
3. [Maximum Number of Vowels in a Substring of Given Length](https://leetcode.com/problems/maximum-number-of-vowels-in-a-substring-of-given-length/)
4. [Find the Index of the First Occurrence in a String](https://leetcode.com/problems/find-the-index-of-the-first-occurrence-in-a-string/)
5. [Rotate String](https://leetcode.com/problems/rotate-string/)
6. [Longest Prefix Suffix](https://leetcode.com/problems/longest-prefix-suffix/)
7. [Check If a String Is a Prefix of Array](https://leetcode.com/problems/check-if-a-string-is-a-prefix-of-array/)
8. [Number of Matching Subsequences](https://leetcode.com/problems/number-of-matching-subsequences/)

### Trie Related
1. [Implement Trie (Prefix Tree)](https://leetcode.com/problems/implement-trie-prefix-tree/)
2. [Word Search II](https://leetcode.com/problems/word-search-ii/)
3. [Add and Search Word - Data structure design](https://leetcode.com/problems/design-add-and-search-words-data-structure/)
4. [Prefix and Suffix Search](https://leetcode.com/problems/prefix-and-suffix-search/)
5. [Map Sum Pairs](https://leetcode.com/problems/map-sum-pairs/)
6. [Replace Words](https://leetcode.com/problems/replace-words/)
7. [Longest Word in Dictionary](https://leetcode.com/problems/longest-word-in-dictionary/)
8. [Camelcase Matching](https://leetcode.com/problems/camelcase-matching/)
9. [Stream of Characters](https://leetcode.com/problems/stream-of-characters/)
10. [Maximum XOR of Two Numbers in an Array](https://leetcode.com/problems/maximum-xor-of-two-numbers-in-an-array/)

### Advanced String Matching Challenges
1. [Palindrome Pairs](https://leetcode.com/problems/palindrome-pairs/)
2. [Maximum Number of Non-overlapping Substrings](https://leetcode.com/problems/maximum-number-of-non-overlapping-substrings/)
3. [Longest Chunked Palindrome Decomposition](https://leetcode.com/problems/longest-chunked-palindrome-decomposition/)
4. [Special Binary String](https://leetcode.com/problems/special-binary-string/)




String matching is a fundamental concept in computer science, widely used in search engines, plagiarism detection, bioinformatics, and database searching.Following are some common patterns and algorithms on the same.Z Algorithm Related
Implement strS

String Matching Algorithms Based Questions.

String matching is a fundamental concept in computer science, widely used in search engines, plagiarism detection, bioinformatics, and database searching.

Following are some common patterns and algorithms on the same.

Z Algorithm Related

Rabin-Karp Related

KMP Related

Trie Related

Advanced String Matching Challenges