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.
Tag: Recursive
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 Subsequence | Finding all LCS
Given two sequences, print all the possible longest common subsequences present in them.
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.
Find all strings of a given length containing balanced parentheses
Given a positive number n, find all strings of length n containing balanced parentheses.
Find all permutations of a string in C++ (Using Backtracking and STL)
This post will find all permutations of a string containing all distinct characters in C++. For example, the string ABC has 6 permutations, i.e., ABC, ACB, BAC, BCA, CBA, CAB.
Find all possible combinations by replacing given digits with characters of the corresponding list
Given n lists of characters and a number whose digits lie between 1 and n, print all possible combinations by replacing its digits with the characters of the corresponding list.
Find all possible combinations of words formed from the mobile keypad
Given a sequence of numbers between 2 and 9, print all possible combinations of words formed from the mobile keypad with some digits associated with each key.