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.
- Print all the combinations of a string in lexicographical order
- Print all distinct circular strings of length M in lexicographical order
- Sort the words in lexicographical order in Python
- Generating distinct subsequences of a given string in lexicographic order
- Longest Common Substring | DP-29
- Longest Common Subsequence | DP-4
- Print all subsequences of a string
- Longest Common Subsequence | DP using Memoization
- Longest Common Anagram Subsequence
- Printing Longest Common Subsequence
- C++ Program for Longest Common Subsequence
- LCS (Longest Common Subsequence) of three strings
- Longest Common Subsequence with at most k changes allowed
- Longest Common Increasing Subsequence (LCS + LIS)
- Print all subsequences of a string using ArrayList