Given two strings A and B consisting of only lowercase letters, the task is to find the minimum number of subsequences required from A to form B.
Input: A = “abbace” B = “acebbaae”
Sub-sequences “ace”, “bba”, “ae” from string A used to form string B
Input: A = “abc” B = “cbacbacba”
- Maintain an array for each character of A which will store its indexes in increasing order.
- Traverse through each element of B and increase the counter whenever there is a need for new subsequence.
- Maintain a variable minIndex which will show that elements greater than this index can be taken in current subsequence otherwise increase the counter and update the minIndex to -1.
Below is the implementation of the above approach.
GeeksforGeeks has prepared a complete interview preparation course with premium videos, theory, practice problems, TA support and many more features. Please refer Placement 100 for details
- Minimum number of subsequences required to convert one string to another using Greedy Algorithm
- Minimum number of given operations required to convert a string to another string
- Minimum operations required to convert a binary string to all 0s or all 1s
- Minimum swaps required to convert one binary string to another
- Minimum given operations required to convert a given binary string to all 1's
- Minimum splits required to convert a number into prime segments
- Minimum cuts required to convert a palindromic string to a different palindromic string
- Minimum number of palindromic subsequences to be removed to empty a binary string
- Minimum number of swaps required to make the string K periodic
- Minimum number of adjacent swaps to convert a string into its given anagram
- Minimum changes required to make first string substring of second string
- Number of K length subsequences with minimum sum
- Minimum rotations required to get the same String | Set-2
- Minimum rotations required to get the same string
- Given a number as a string, find the number of contiguous subsequences which recursively add up to 9 | Set 2
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.
Improved By : mohit kumar 29