Number of subsequences of the form a^i b^j c^k - GeeksforGeeks

Number of subsequences of the form a^i b^j c^k - GeeksforGeeks

Given a string, count number of subsequences of the form aⁱb^jc^k, 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)

Read full article from Number of subsequences of the form a^i b^j c^k - GeeksforGeeks