how to find all common subsequence of two string of length k??
Common subsequence between two string with length k
This can be done by creating a dp matrix. Keep two strings in each side of the matrix. Check if they are equal , if yes just take that into your ans. And finally if your size is equal to k print that string.
but it might possible that when k size of some subsequence is ending then new subsequence of size k is forming how it is handle this case??
There can be multiple answers for this. You may take any one
can you share the code i am not getting it??
It would be a good exercise for you. Just write the code for normal max subsequences match and you’ll be there
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.