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()
Input Format
Input is handled for you
Output Format
Output is handled for you
Constraints
1<=s,t length <=100
Notice
Try First, Check Solution later
1. You should first read the question and watch the question video.2. Think of a solution approach, then try and submit the question on editor tab.3. We strongly advise you to watch the solution video for prescribed approach.Example
Input
aaabbc abc
Output
6