Code360 powered by Coding Ninjas X Naukri.com. Code360 powered by Coding
Ninjas X Naukri.com

Problem of the day

You are given two strings 'A' and 'B' of length 'N' and 'M' respectively, your task is to find the number of distinct occurrences of string 'B' in the string A as a subsequence.

```
1. A subsequence is a sequence generated from a string after deleting some characters of string without changing the order of remaining string characters.
2. 'A' and 'B' will be non-empty strings.
```

Detailed explanation

```
The first line of the input contains an integer 'T' denoting the number of test cases.
The first line of each test case contains two space-separated integers 'N' and 'M', the length of string 'A' and 'B' respectively.
The second line of each test case contains a string 'A'.
The third line of each test case contains a string 'B'.
```

```
For each test case, return an integer denoting the number of distinct occurrences of 'B' in 'A' as a subsequence.
```

```
You don't need to print anything, it has already been taken care of. Just implement the given function.
```

```
1 <= T <= 100
1 <= M, N <= 100
Time limit: 1 sec
```

```
2
12 3
codingninjas
cij
2 1
aa
b
```

```
2
0
```

```
In test case 1, Possible subsequences are: [c i j ], [c i j ].
In test case 2, There is no possible subsequence.
```

```
2
4 2
abcd
ac
6 3
banana
ban
```

```
1
3
```

```
In test case 1, Possible subsequence is: [a c ].
In test case 2, Possible subsequences are: [ban], [ba n ],[b an ].
```