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: String
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.
Longest Common Subsequence Problem
The Longest Common Subsequence (LCS) problem is finding the longest subsequence present in given two sequences in the same order, i.e., find the longest sequence which can be obtained from the first original sequence by deleting some items and from the second original sequence by deleting other items.
Find all combinations of non-overlapping substrings of a string
Given a string, find all combinations of non-overlapping substrings of it. The solution should use parenthesis to split the string into non-overlapping substrings.
Generate binary numbers between 1 to `n` using a queue
Given a positive number n, efficiently generate binary numbers between 1 and n using the queue data structure in linear time.