Question

Given two sequences s, t, count number of unique ways in sequence s, to form a subsequence that is identical to the sequence t.

Answer 1

Hi buddy

Here is your answer.

Input : S = banana, T = banOutput : 3T appears in S as below three subsequences.[ban], [ba n], [b an]Input : S = geeksforgeeks, T = geOutput : 6T appears in S as below three subsequences.[ge], [ ge], [g e], [g e] [g e]and [ g e]

Answer 2

Answer:

hi buddy

here is your answer..

please click the brainlist answer..