Distinct Transformations
easy
1. You will be given 2 strings s and t 2. You need to find count of unique ways one can make a subsequence from s that is an identical to t 3. Find and return all unique ways 4. Input and output is handled for you 5. It is a functional problem ,please do not modify main()
Constraints
1<=s,t length <=100
Format
Input
Input is handled for you
Output
Output is handled for you
Example
Sample Input
aaabbc
abc
Sample Output
6