Problem Statement: Wildcard Matching We are given two strings ‘S1’ and ‘S2’. String S1 can have the following two special characters:

Continue reading# Category: dynamic programming

## Edit Distance | (DP-33)

Problem Statement: Edit Distance We are given two strings ‘S1’ and ‘S2’. We need to convert S1 to S2. The following

Continue reading## Distinct Subsequences| (DP-32)

Problem Statement: Distinct Subsequences Problem Link: Subsequence Counting We are given two strings S1 and S2, we want to know how

Continue reading## Shortest Common Supersequence | (DP – 31)

Problem Statement: Shortest Common Supersequence We are given two strings ‘S1’ and ‘S2’. We need to return their shortest common supersequence.

Continue reading## Minimum insertions to make string palindrome | DP-29

Problem Statement: Minimum insertions required to make a string palindrome A palindromic string is a string that is the same

Continue reading## Minimum Insertions/Deletions to Convert String | (DP- 30)

Problem Statement: Minimum Insertions/Deletions to Convert String A to String B We are given two strings, str1 and str2. We

Continue reading## Longest Palindromic Subsequence | (DP-28)

Problem Statement: Longest Palindromic Subsequence A palindromic string is a string that is equal to its reverse. For example: “nitin” is

Continue reading## Longest Common Substring | (DP – 27)

Problem Statement: Longest Common Substring A substring of a string is a subsequence in which all the characters are consecutive. Given

Continue reading## Print Longest Common Subsequence | (DP – 26)

Problem Statement: Print Longest Common Subsequence In the previous article Longest Common Subsequence, we learned to print the length of

Continue reading## Longest Common Subsequence | (DP – 25)

Problem Statement: Introduction to DP on Strings – Longest Common Subsequence In the coming articles, we will discuss problems related to

Continue reading