Given a string, count number of subsequences of the form aibjck, i.e., it consists of i ’a’ characters, followed by j ’b’ characters, followed by k ’c’ characters where i >= 1, j >=1 and k >= 1.
Note: Two subsequences are considered different if the set of array indexes picked for the 2 subsequences are different.
Expected Time Complexity: O(n)
Input : abbc Output : 3 Subsequences are abc, abc and abbc Input : abcabc Output : 7 Subsequences are abc, abc, abbc, aabc abcc, abc and abc
We traverse given string. For every character encounter, we do the following:
1) Initialize counts of different subsequences caused by different combination of ‘a’. Let this count be aCount.
2) Initialize counts of different subsequences caused by different combination of ‘b’. Let this count be bCount.
3) Initialize counts of different subsequences caused by different combination of ‘c’. Let this count be cCount.
4) Traverse all characters of given string. Do following for current character s[i]
If current character is ‘a’, then there are following possibilities :
a) Current character begins a new subsequence.
b) Current character is part of aCount subsequences.
c) Current character is not part of aCount subsequences.
Therefore we do aCount = (1 + 2 * aCount);
If current character is ‘b’, then there are following possibilities :
a) Current character begins a new subsequence of b’s with aCount subsequences.
b) Current character is part of bCount subsequences.
c) Current character is not part of bCount subsequences.
Therefore we do bCount = (aCount + 2 * bCount);
If current character is ‘c’, then there are following possibilities :
a) Current character begins a new subsequence of c’s with bCount subsequences.
b) Current character is part of cCount subsequences.
c) Current character is not part of cCount subsequences.
Therefore we do cCount = (bCount + 2 * cCount);
5) Finally we return cCount;
Explanation of approach with help of example:
- aCount is the number of subsequences of the letter ‘a’.
- Consider this example: aa.
- We can see that aCount for this is 3, because we can choose these possibilities: (xa, ax, aa) (x means we did not use that character). Note also that this is independent of characters in between, i.e. the aCount of aa and ccbabbbcac are the same because both have exactly 2 a’s.
- Now, adding 1 a, we now have the following new subsequences: each of the old subsequences, each of the old subsequences + the new a, and the new letter a, alone. So a total of aCount + aCount + 1 subsequences.
- Now, let’s consider bCount, the number of subsequences with some a’s and then some b’s. in ‘aab’, we see that bCount should be 3 (axb, xab, aab) because it is just the number of ways we can choose subsequences of the first two a’s, and then b. So every time we add a b, the number of ways increases by aCount.
- Let’s find bCount for ‘aabb’. We have already determined that aab has 3 subsequences, so certainly we still have those. Additionally, we can add the new b onto any of these subsequences, to get 3 more. Finally, we have to count the subsequences that are made without using any other b’s, and by the logic in the last paragraph, that is just aCount. So, bCount after this is just the old bCount*2 + aCount;
- cCount is similar.
Below is the implementation of above idea:
- Time Complexity: O(n).
One traversal of the string is needed.
- Auxiliary Space: O(1).
No extra space is needed.
This article is contributed by Mr. Somesh Awasthi. 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.
- Count of subsequences of length 4 in form (x, x, x+1, x+1) | Set 2
- Given a number as a string, find the number of contiguous subsequences which recursively add up to 9
- Given a number as a string, find the number of contiguous subsequences which recursively add up to 9 | Set 2
- Minimum number of palindromic subsequences to be removed to empty a binary string
- Count minimum number of subsets (or subsequences) with consecutive numbers
- Number of subsequences in a string divisible by n
- Number of subsequences as "ab" in a string repeated K times
- Number of palindromic subsequences of length k where k <= 3
- Sum of all subsequences of a number
- Number of ways to partition a string into two balanced subsequences
- Number of subsequences with zero sum
- Number of Subsequences with Even and Odd Sum
- Number of Subsequences with Even and Odd Sum | Set 2
- Count the number of subsequences of length k having equal LCM and HCF
- Number of K length subsequences with minimum sum
- Number of subsequences of maximum length K containing no repeated elements
- Number of subsequences in a given binary string divisible by 2
- Number of subsequences with positive product
- Count the number of contiguous increasing and decreasing subsequences in a sequence
- Minimum number of subsequences required to convert one string to another