Scribd
Upload
16 views2 pages

String All Pattern

The document outlines various string algorithms and their applications, including the KMP Algorithm, Z-Algorithm, Rabin-Karp Algorithm, and more. Each pattern includes specific problems related to string matching, palindromes, edit distance, and trie implementations. Additionally, it covers dynamic programming techniques applied to strings and intervals.

Uploaded by

Rajni Singla
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
16 views2 pages

String All Pattern

The document outlines various string algorithms and their applications, including the KMP Algorithm, Z-Algorithm, Rabin-Karp Algorithm, and more. Each pattern includes specific problems related to string matching, palindromes, edit distance, and trie implementations. Additionally, it covers dynamic programming techniques applied to strings and intervals.

Uploaded by

Rajni Singla
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

‭ ‬‭Strings‬

►
‭Pattern 1: KMP Algorithm‬
‭→ String Matching‬
‭→ Find the Index of the First Occurrence in a String‬
‭→ Shortest Palindrome‬
‭→ Longest Happy Prefix‬
‭→ Implement strStr()‬

‭ attern 2: Z-Algorithm‬
P
‭→ String Matching‬
‭→ Shortest Palindrome‬
‭→ Pattern Search‬
‭→ Count and Say‬
‭→ Frequency of Pattern‬

‭ attern 3: Rabin-Karp Algorithm‬


P
‭→ String Matching‬
‭→ Repeated String Match‬
‭→ Find All Anagrams in a String‬
‭→ Substring with Concatenation of All Words‬
‭→ Detect Cycle in a Circular Array‬

‭ attern 4: Longest Common Subsequence‬


P
‭→ Longest Common Subsequence‬
‭→ Uncrossed Lines‬
‭→ Minimum ASCII Delete Sum for Two Strings‬
‭→ Shortest Common Supersequence‬
‭→ Delete Operation for Two Strings‬

‭ attern 5: Edit Distance‬


P
‭→ Edit Distance‬
‭→ Word Ladder‬
‭→ Word Break II‬
‭→ Sequence Alignment‬
‭→ Minimum Steps to Convert Word‬

‭ attern 6: Regular Expression Matching‬


P
‭→ Regular Expression Matching‬
‭→ Wildcard Matching‬
‭→ Word Search‬
‭→ Valid Palindrome II‬
‭→ Pattern Matching in String‬
‭ attern 7: Palindrome Problems‬
P
‭→ Palindrome Partitioning‬
‭→ Valid Palindrome II‬
‭→ Longest Palindromic Subsequence‬
‭→ Palindromic Substrings‬
‭→ Minimum Cuts for Palindromes‬

‭ attern 8: Trie (Prefix Tree)‬


P
‭→ Implement Trie‬
‭→ Add and Search Word‬
‭→ Replace Words‬
‭→ Map Sum Pairs‬
‭→ Word Search II‬

‭ attern 9: DP on Intervals for Strings‬


P
‭→ Palindrome Partitioning II‬
‭→ Burst Balloons‬
‭→ Strange Printer‬
‭→ Matrix Chain Multiplication‬
‭→ Optimal Binary Search Tree‬

You might also like