The Levenshtein distance (Edit distance) Problem
Edit distance is a way of quantifying how different two strings are from one another by counting the minimum number of operations required to transform one string into the other.
Category: Dynamic Programming
Maximum Sum Increasing Subsequence Problem
Find a subsequence of a given sequence such that the subsequence sum is as high as possible and the subsequence’s elements are in sorted order, from lowest to highest. This subsequence is not necessarily contiguous or unique.
Longest Bitonic Subsequence
The longest bitonic subsequence problem is to find a subsequence of a given sequence in which the subsequence’s elements are first sorted in increasing order, then in decreasing order, and the subsequence is as long as possible.
Longest Increasing Subsequence using Dynamic Programming
The longest increasing subsequence problem is to find a subsequence of a given sequence in which the subsequence’s elements are in sorted order, lowest to highest, and in which the subsequence is as long as possible. This subsequence is not necessarily contiguous or unique.
Shortest Common Supersequence Problem using LCS
The Shortest Common Supersequence (SCS) is finding the shortest supersequence Z of given sequences X and Y such that both X and Y are subsequences of Z.
Shortest Common Supersequence | Finding all SCS
The Shortest Common Supersequence (SCS) is finding the shortest supersequence Z of given sequences X and Y such that both X and Y are subsequences of Z.
Shortest Common Supersequence Problem
The Shortest Common Supersequence (SCS) is finding the shortest supersequence Z of given sequences X and Y such that both X and Y are subsequences of Z.
Longest Repeated Subsequence Problem
The Longest Repeating Subsequence (LRS) problem is finding the longest subsequences of a string that occurs at least twice.
Longest Palindromic Subsequence using Dynamic Programming
The Longest Palindromic Subsequence (LPS) problem is finding the longest subsequences of a string that is also a palindrome.
Longest Common Substring Problem
The longest common substring problem is the problem of finding the longest string (or strings) that is a substring (or are substrings) of two strings.
Longest Common Subsequence | Finding all LCS
Given two sequences, print all the possible longest common subsequences present in them.
Longest Common Subsequence (LCS) | Space optimized version
This post covers a space-optimized function to find the length of the Longest Common Subsequence (LCS) problem.