Number of subsequences of the string in the form a^i b^j c^k
where i>=1,j>=1 && k>=1
how to approach this problem recursively
Help me out in this problem
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.