Stack: Get the min element of the stack in O(1) time
Problem Statement: You need to implement a stack that will return the min element in constant time. Solution This problem can be solved in 2…
Dynamic Programming: Get the count of delete operations on 2 strings.
Problem Statement: You are given 2 strings, you need to return the minimum number of delete operations needed to make str1 and str 2 same.…
Dynamic Programming: Longest Common Substring
Problem Statement: You are given 2 strings, you need to find the longest common substring. Example Example: str 1 = abcdef str 2 = bcxyez…
Dynamic Programming: Count how many times string 1 appears as substring in string 2.
Problem Statement: You are given 2 strings, you need to find how many times string 2 appears as subsequence in string 1. Example string =…
Dynamic Programming: Check if one string is a subsequence of another
Problem Statement: Youa are given 2 strings, a, b. You need to check if string “a” is a subsequence of string “b”…
Dynamic Programming: Longest repeating subsequence
Problem Statement: You are given a string, you need to find the length of the longest repeating subsequence. Example Input: AABEBCDD O/p: 3…
Dynamic Programming: Minimum number of deletions and insertions to convert one string into another
Problem Statement: You are given 2 strings, you need to get the minimum number of insertions and deletions to convert string a to string b.…
Dynamic Programming: Print Shortest Common Supersequence
Problem Statement: You are given 2 strings, you need to print shortest common supersequence. A super sequence is a string that has both string…
Dynamic Programming: Length of Shortest Common Supersequence
Problem Statement: You are given 2 strings, you need to return the length of shortest common supersequence. A super sequence is a string that…
Dynamic Programming: Print Longest Common Sub-sequence
Problem Statement: You are given 2 strings S1 and S2. You need to print the Longest Common Substring. Example Solution We need to first goto…