Pattern Searching
Practice Problems on Pattern Searching
Recent Articles on Pattern Searching
The Pattern Searching algorithms are sometimes also referred to as String Searching Algorithms and are considered as a part of the String algorithms. These algorithms are useful in the case of searching a string within another string.

Topics :
- Naive Pattern Searching
- KMP Algorithm
- Rabin-Karp Algorithm
- A Naive Pattern Searching Question
- Finite Automata
- Efficient Construction of Finite Automata
- Boyer Moore Algorithm â Bad Character Heuristic
- Boyer Moore Algorithm | Good Suffix heuristic
- Aho-Corasick Algorithm for Pattern Searching
- Suffix Array
- kasaiâs Algorithm for Construction of LCP array from Suffix Array
- Z algorithm (Linear time pattern searching Algorithm)
- Online algorithm for checking palindrome in a stream
- Manacherâs Algorithm â Linear Time Longest Palindromic Substring â Part 4
- Ukkonenâs Suffix Tree Construction â Part 1
- Ukkonenâs Suffix Tree Construction â Part 2
- Ukkonenâs Suffix Tree Construction â Part 3
- Ukkonenâs Suffix Tree Construction â Part 4
- Ukkonenâs Suffix Tree Construction â Part 5
- Ukkonenâs Suffix Tree Construction â Part 6
- Generalized Suffix Tree 1
- Anagram Substring Search (Or Search for all permutations)
- Pattern Searching using a Trie of all Suffixes
- Program to wish Womenâs Day
- Program to replace a word with asterisks in a sentence
- Dynamic Programming | Wildcard Pattern Matching | Linear Time and Constant Space
- Pattern Searching using C++ library
- Longest prefix which is also suffix
- Splitting a Numeric String
- Count of number of given string in 2D character array
- Find minimum shift for longest common prefix
- Find all the patterns of â1(0+)1â in a given string | SET 1(General Approach)
- Find all the patterns of â1(0+)1â in a given string | SET 2(Regular Expression Approach)
- is_permutation() in C++ and its application for anagram search
- Match Expression where a single special character in pattern can match one or more characters
- Maximum length prefix of one string that occurs as subsequence in another
- Wildcard Pattern Matching
- Find all occurrences of a given word in a matrix
- Search a Word in a 2D Grid of characters
- String matching where one string contains wildcard characters
- Suffix Tree Application 1 â Substring Check
- Suffix Tree Application 2 – Searching All Patterns
- Suffix Tree Application 3 – Longest Repeated Substring
- Suffix Tree Application 4 – Build Suffix Array
- Suffix Tree Application 5 -Longest Common Substring
- Suffix Tree Application 6 – Longest Palindromic Substring

