You are given two strings.Now you have to print all longest common sub-sequences in lexicographical order?
Input : str1 = "abcabcaa", str2 = "acbacba" Output: ababa abaca abcba acaba acaca acbaa acbca
This problem is an extension of longest common subsequence. We first find length of LCS and store all LCS in 2D table using Memoization (or Dynamic Programming). Then we search all characters from ‘a’ to ‘z’ (to output sorted order) in both strings. If a character is found in both strings and current positions of character lead to LCS, we recursively search all occurrences with current LCS length plus 1.
Below is the implementation of algorithm.
ababa abaca abcba acaba acaca acbaa acbca
This article is contributed by Shashak Mishra ( Gullu ). If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
- Print all distinct circular strings of length M in lexicographical order
- Print all the combinations of a string in lexicographical order
- Generate all numbers up to N in Lexicographical Order
- Print all lexicographical greater permutations of a given string
- Sort the words in lexicographical order in Python
- Find the k-th string in lexicographical order consisting of n-2 X's and 2 Y's
- Longest Increasing Subsequence using Longest Common Subsequence Algorithm
- Lexicographical concatenation of all substrings of a string
- Print all subsequences of a string
- Print all subsequences of a string | Iterative Method
- Print all subsequences of a string using ArrayList
- Print all subsequences of a string in Python
- Printing Longest Common Subsequence | Set 2 (Printing All)
- Generating distinct subsequences of a given string in lexicographic order
- Find product of all elements at indexes which are factors of M for all possible sorted subsequences of length M
- Lexicographical Maximum substring of string
- Find the lexicographical next balanced bracket sequence
- K-th lexicographical string of given length
- Lexicographical smallest alternate Array
- Largest lexicographical string with at most K consecutive elements
Improved By : mohit kumar 29