Minimum number of subsequences required to convert one string to another using Greedy Algorithm
Last Updated :
15 Sep, 2021
Given two strings A and B consists of lowercase letters, the task to find the minimum number of subsequence required to form A from B. If it is impossible to form, print -1.
Examples:
Input: A = "aacbe", B = "aceab"
Output: 3
Explanation:
The minimum number of subsequences required for creating A from B is "aa", "cb" and "e".
Input: A = "geeks", B = "geekofthemonth"
Output: -1
Explanation:
It is not possible to create A, as the character 's' is missing in B.
For brute-force approach refer here
Minimum number of subsequences required to convert one string to another
Greedy Approach:
- Create a 2D-Array of 26 * size_of_string_B to store the occurrence of indices of the character and initialize the array with 'infinite' values.
- Maintain the 2D Array with indices of the character in the String B
- If the value of any element of the 2D Array is infinite, then update the value with the next value in the same row.
- Initialize the position of the pointer to 0
- Iterate the String A and for each character -
- If the position of the pointer is 0 and if that position in the 2D Array is infinite, then the character is not present in the string B.
- If the value in the 2D Array is not equal to infinite, then update the value of the position with the value present at the 2D Array for that position of the pointer, Because the characters before it cannot be considered in the subsequence.
Below is the implementation of the above approach.
C++
// C++ implementation for minimum
// number of subsequences required
// to convert one string to another
#include <iostream>
using namespace std;
// Function to find the minimum number
// of subsequences required to convert
// one string to another
// S2 == A and S1 == B
int findMinimumSubsequences(string A,
string B){
// At least 1 subsequence is required
// Even in best case, when A is same as B
int numberOfSubsequences = 1;
// size of B
int sizeOfB = B.size();
// size of A
int sizeOfA = A.size();
int inf = 1000000;
// Create an 2D array next[][]
// of size 26 * sizeOfB to store
// the next occurrence of a character
// ('a' to 'z') as an index [0, sizeOfA - 1]
int next[26][sizeOfB];
// Array Initialization with infinite
for (int i = 0; i < 26; i++) {
for (int j = 0; j < sizeOfB; j++) {
next[i][j] = inf;
}
}
// Loop to Store the values of index
for (int i = 0; i < sizeOfB; i++) {
next[B[i] - 'a'][i] = i;
}
// If the value of next[i][j]
// is infinite then update it with
// next[i][j + 1]
for (int i = 0; i < 26; i++) {
for (int j = sizeOfB - 2; j >= 0; j--) {
if (next[i][j] == inf) {
next[i][j] = next[i][j + 1];
}
}
}
// Greedy algorithm to obtain the maximum
// possible subsequence of B to cover the
// remaining string of A using next subsequence
int pos = 0;
int i = 0;
// Loop to iterate over the string A
while (i < sizeOfA) {
// Condition to check if the character is
// not present in the string B
if (pos == 0 &&
next[A[i] - 'a'][pos] == inf) {
numberOfSubsequences = -1;
break;
}
// Condition to check if there
// is an element in B matching with
// character A[i] on or next to B[pos]
// given by next[A[i] - 'a'][pos]
else if (pos < sizeOfB &&
next[A[i] - 'a'][pos] < inf) {
int nextIndex = next[A[i] - 'a'][pos] + 1;
pos = nextIndex;
i++;
}
// Condition to check if reached at the end
// of B or no such element exists on
// or next to A[pos], thus increment number
// by one and reinitialise pos to zero
else {
numberOfSubsequences++;
pos = 0;
}
}
return numberOfSubsequences;
}
// Driver Code
int main()
{
string A = "aacbe";
string B = "aceab";
cout << findMinimumSubsequences(A, B);
return 0;
}
// Java implementation for minimum
// number of subsequences required
// to convert one String to another
class GFG
{
// Function to find the minimum number
// of subsequences required to convert
// one String to another
// S2 == A and S1 == B
static int findMinimumSubsequences(String A,
String B)
{
// At least 1 subsequence is required
// Even in best case, when A is same as B
int numberOfSubsequences = 1;
// size of B
int sizeOfB = B.length();
// size of A
int sizeOfA = A.length();
int inf = 1000000;
// Create an 2D array next[][]
// of size 26 * sizeOfB to store
// the next occurrence of a character
// ('a' to 'z') as an index [0, sizeOfA - 1]
int [][]next = new int[26][sizeOfB];
// Array Initialization with infinite
for (int i = 0; i < 26; i++) {
for (int j = 0; j < sizeOfB; j++) {
next[i][j] = inf;
}
}
// Loop to Store the values of index
for (int i = 0; i < sizeOfB; i++) {
next[B.charAt(i) - 'a'][i] = i;
}
// If the value of next[i][j]
// is infinite then update it with
// next[i][j + 1]
for (int i = 0; i < 26; i++) {
for (int j = sizeOfB - 2; j >= 0; j--) {
if (next[i][j] == inf) {
next[i][j] = next[i][j + 1];
}
}
}
// Greedy algorithm to obtain the maximum
// possible subsequence of B to cover the
// remaining String of A using next subsequence
int pos = 0;
int i = 0;
// Loop to iterate over the String A
while (i < sizeOfA) {
// Condition to check if the character is
// not present in the String B
if (pos == 0 &&
next[A.charAt(i)- 'a'][pos] == inf) {
numberOfSubsequences = -1;
break;
}
// Condition to check if there
// is an element in B matching with
// character A[i] on or next to B[pos]
// given by next[A[i] - 'a'][pos]
else if (pos < sizeOfB &&
next[A.charAt(i) - 'a'][pos] < inf) {
int nextIndex = next[A.charAt(i) - 'a'][pos] + 1;
pos = nextIndex;
i++;
}
// Condition to check if reached at the end
// of B or no such element exists on
// or next to A[pos], thus increment number
// by one and reinitialise pos to zero
else {
numberOfSubsequences++;
pos = 0;
}
}
return numberOfSubsequences;
}
// Driver Code
public static void main(String[] args)
{
String A = "aacbe";
String B = "aceab";
System.out.print(findMinimumSubsequences(A, B));
}
}
// This code is contributed by Rajput-Ji
# Python3 implementation for minimum
# number of subsequences required
# to convert one to another
# Function to find the minimum number
# of subsequences required to convert
# one to another
# S2 == A and S1 == B
def findMinimumSubsequences(A, B):
# At least 1 subsequence is required
# Even in best case, when A is same as B
numberOfSubsequences = 1
# size of B
sizeOfB = len(B)
# size of A
sizeOfA = len(A)
inf = 1000000
# Create an 2D array next[][]
# of size 26 * sizeOfB to store
# the next occurrence of a character
# ('a' to 'z') as an index [0, sizeOfA - 1]
next = [[ inf for i in range(sizeOfB)] for i in range(26)]
# Loop to Store the values of index
for i in range(sizeOfB):
next[ord(B[i]) - ord('a')][i] = i
# If the value of next[i][j]
# is infinite then update it with
# next[i][j + 1]
for i in range(26):
for j in range(sizeOfB-2, -1, -1):
if (next[i][j] == inf):
next[i][j] = next[i][j + 1]
# Greedy algorithm to obtain the maximum
# possible subsequence of B to cover the
# remaining of A using next subsequence
pos = 0
i = 0
# Loop to iterate over the A
while (i < sizeOfA):
# Condition to check if the character is
# not present in the B
if (pos == 0 and
next[ord(A[i]) - ord('a')][pos] == inf):
numberOfSubsequences = -1
break
# Condition to check if there
# is an element in B matching with
# character A[i] on or next to B[pos]
# given by next[A[i] - 'a'][pos]
elif (pos < sizeOfB and
next[ord(A[i]) - ord('a')][pos] < inf) :
nextIndex = next[ord(A[i]) - ord('a')][pos] + 1
pos = nextIndex
i += 1
# Condition to check if reached at the end
# of B or no such element exists on
# or next to A[pos], thus increment number
# by one and reinitialise pos to zero
else :
numberOfSubsequences += 1
pos = 0
return numberOfSubsequences
# Driver Code
if __name__ == '__main__':
A = "aacbe"
B = "aceab"
print(findMinimumSubsequences(A, B))
# This code is contributed by mohit kumar 29
// C# implementation for minimum
// number of subsequences required
// to convert one String to another
using System;
class GFG
{
// Function to find the minimum number
// of subsequences required to convert
// one String to another
// S2 == A and S1 == B
static int findMinimumSubsequences(String A,
String B)
{
// At least 1 subsequence is required
// Even in best case, when A is same as B
int numberOfSubsequences = 1;
// size of B
int sizeOfB = B.Length;
// size of A
int sizeOfA = A.Length;
int inf = 1000000;
// Create an 2D array next[,]
// of size 26 * sizeOfB to store
// the next occurrence of a character
// ('a' to 'z') as an index [0, sizeOfA - 1]
int [,]next = new int[26,sizeOfB];
// Array Initialization with infinite
for (int i = 0; i < 26; i++)
{
for (int j = 0; j < sizeOfB; j++)
{
next[i, j] = inf;
}
}
// Loop to Store the values of index
for (int i = 0; i < sizeOfB; i++)
{
next[B[i] - 'a', i] = i;
}
// If the value of next[i,j]
// is infinite then update it with
// next[i,j + 1]
for (int i = 0; i < 26; i++)
{
for (int j = sizeOfB - 2; j >= 0; j--)
{
if (next[i, j] == inf)
{
next[i, j] = next[i, j + 1];
}
}
}
// Greedy algorithm to obtain the maximum
// possible subsequence of B to cover the
// remaining String of A using next subsequence
int pos = 0;
int I = 0;
// Loop to iterate over the String A
while (I < sizeOfA)
{
// Condition to check if the character is
// not present in the String B
if (pos == 0 &&
next[A[I]- 'a', pos] == inf)
{
numberOfSubsequences = -1;
break;
}
// Condition to check if there
// is an element in B matching with
// character A[i] on or next to B[pos]
// given by next[A[i] - 'a',pos]
else if (pos < sizeOfB &&
next[A[I] - 'a',pos] < inf)
{
int nextIndex = next[A[I] - 'a',pos] + 1;
pos = nextIndex;
I++;
}
// Condition to check if reached at the end
// of B or no such element exists on
// or next to A[pos], thus increment number
// by one and reinitialise pos to zero
else
{
numberOfSubsequences++;
pos = 0;
}
}
return numberOfSubsequences;
}
// Driver Code
public static void Main(String[] args)
{
String A = "aacbe";
String B = "aceab";
Console.Write(findMinimumSubsequences(A, B));
}
}
// This code is contributed by 29AjayKumar
<script>
// Javascript implementation for minimum
// number of subsequences required
// to convert one String to another
// Function to find the minimum number
// of subsequences required to convert
// one String to another
// S2 == A and S1 == B
function findMinimumSubsequences(A,B)
{
// At least 1 subsequence is required
// Even in best case, when A is same as B
let numberOfSubsequences = 1;
// size of B
let sizeOfB = B.length;
// size of A
let sizeOfA = A.length;
let inf = 1000000;
// Create an 2D array next[][]
// of size 26 * sizeOfB to store
// the next occurrence of a character
// ('a' to 'z') as an index [0, sizeOfA - 1]
let next = new Array(26);
// Array Initialization with infinite
for (let i = 0; i < 26; i++) {
next[i]=new Array(sizeOfB);
for (let j = 0; j < sizeOfB; j++) {
next[i][j] = inf;
}
}
// Loop to Store the values of index
for (let i = 0; i < sizeOfB; i++) {
next[B[i].charCodeAt(0) - 'a'.charCodeAt(0)][i] = i;
}
// If the value of next[i][j]
// is infinite then update it with
// next[i][j + 1]
for (let i = 0; i < 26; i++) {
for (let j = sizeOfB - 2; j >= 0; j--) {
if (next[i][j] == inf) {
next[i][j] = next[i][j + 1];
}
}
}
// Greedy algorithm to obtain the maximum
// possible subsequence of B to cover the
// remaining String of A using next subsequence
let pos = 0;
let i = 0;
// Loop to iterate over the String A
while (i < sizeOfA) {
// Condition to check if the character is
// not present in the String B
if (pos == 0 &&
next[A[i].charCodeAt(0)- 'a'.charCodeAt(0)][pos] == inf) {
numberOfSubsequences = -1;
break;
}
// Condition to check if there
// is an element in B matching with
// character A[i] on or next to B[pos]
// given by next[A[i] - 'a'][pos]
else if (pos < sizeOfB &&
next[A[i].charCodeAt(0) - 'a'.charCodeAt(0)][pos] < inf) {
let nextIndex = next[A[i].charCodeAt(0) - 'a'.charCodeAt(0)][pos] + 1;
pos = nextIndex;
i++;
}
// Condition to check if reached at the end
// of B or no such element exists on
// or next to A[pos], thus increment number
// by one and reinitialise pos to zero
else {
numberOfSubsequences++;
pos = 0;
}
}
return numberOfSubsequences;
}
// Driver Code
let A = "aacbe";
let B = "aceab";
document.write(findMinimumSubsequences(A, B));
// This code is contributed by unknown2108
</script>
Time Complexity: O(N), where N is the length of string to be formed (here A)
Auxiliary Space Complexity: O(N), where N is the length of string to be formed (here A)
Similar Reads
DSA Tutorial - Learn Data Structures and Algorithms DSA (Data Structures and Algorithms) is the study of organizing data efficiently using data structures like arrays, stacks, and trees, paired with step-by-step procedures (or algorithms) to solve problems effectively. Data structures manage how data is stored and accessed, while algorithms focus on
7 min read
Quick Sort QuickSort is a sorting algorithm based on the Divide and Conquer that picks an element as a pivot and partitions the given array around the picked pivot by placing the pivot in its correct position in the sorted array. It works on the principle of divide and conquer, breaking down the problem into s
12 min read
Merge Sort - Data Structure and Algorithms Tutorials Merge sort is a popular sorting algorithm known for its efficiency and stability. It follows the divide-and-conquer approach. It works by recursively dividing the input array into two halves, recursively sorting the two halves and finally merging them back together to obtain the sorted array. Merge
14 min read
Bubble Sort Algorithm Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in the wrong order. This algorithm is not suitable for large data sets as its average and worst-case time complexity are quite high.We sort the array using multiple passes. After the fir
8 min read
Data Structures Tutorial Data structures are the fundamental building blocks of computer programming. They define how data is organized, stored, and manipulated within a program. Understanding data structures is very important for developing efficient and effective algorithms. What is Data Structure?A data structure is a st
2 min read
Breadth First Search or BFS for a Graph Given a undirected graph represented by an adjacency list adj, where each adj[i] represents the list of vertices connected to vertex i. Perform a Breadth First Search (BFS) traversal starting from vertex 0, visiting vertices from left to right according to the adjacency list, and return a list conta
15+ min read
Binary Search Algorithm - Iterative and Recursive Implementation Binary Search Algorithm is a searching algorithm used in a sorted array by repeatedly dividing the search interval in half. The idea of binary search is to use the information that the array is sorted and reduce the time complexity to O(log N). Binary Search AlgorithmConditions to apply Binary Searc
15 min read
Insertion Sort Algorithm Insertion sort is a simple sorting algorithm that works by iteratively inserting each element of an unsorted list into its correct position in a sorted portion of the list. It is like sorting playing cards in your hands. You split the cards into two groups: the sorted cards and the unsorted cards. T
9 min read
Dijkstra's Algorithm to find Shortest Paths from a Source to all Given a weighted undirected graph represented as an edge list and a source vertex src, find the shortest path distances from the source vertex to all other vertices in the graph. The graph contains V vertices, numbered from 0 to V - 1.Note: The given graph does not contain any negative edge. Example
12 min read
Selection Sort Selection Sort is a comparison-based sorting algorithm. It sorts an array by repeatedly selecting the smallest (or largest) element from the unsorted portion and swapping it with the first unsorted element. This process continues until the entire array is sorted.First we find the smallest element an
8 min read