Distinct Transformations

medium

Unknown

Question Solve Solutions

1. You are given two strings S1 and S2.
2. You have to find the number of unique ways in which you can transform S1 to S2.
3. Transformation can be achieved by removing 0 or more characters from S1, such that the sequence formed by the remaining characters of S1 is identical to S2.

Input Format

Two Strings S1 and S2

Output Format

A number representing the count of distinct transformations.

Constraints

1 <= length of strings S1 and S2 <= 1000

Example

Input

abcccdf
abccdf

Output

Minimum Cost To Make Two Strings Identical

Maximum Difference Of Zeros And Ones In Binary String

Related Questions

easy Is Prime easy Prime Till N easy Reverse Integer easy GCD easy Fibonacci easy Fib Till N easy Exit Point of a matrix easy Placing N Queen in a matrix easy Arranging Vowels And Consonants easy Addition Of Two Linked List easy Circular Linked List easy Sort The Absolute List easy Decimal Number From Binary Linked List easy Find the largest rectangle in a matrix easy Count Pairs Having Sum X easy Delete alternate nodes of linked list