Given two sequences A, B, find out number of unique ways in sequence A, to form a subsequence that is identical to the sequence B.
A = "abcccdf" B = "abccdf"
Return 3. And the formations as follows:
"." is where character is removed.
First line contains the test cases T. 1<=T<=500
Each test case have two lines
First is a string A of length less than 1000.
Second is a string B of length less than 100.
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.