Distinct Subsequences

Hard

📝 Description

Count the number of distinct subsequences of S that equal T

Input Format

Strings S and T

Output Format

Number of distinct subsequences

Constraints

1 ≤ S.length, T.length ≤ 1000

🔍 Sample Input

"rabbbit"
"rabbit"

✅ Sample Output

3

Code Editor

Please login to run and submit code.

Shortcuts: Ctrl+Enter to submit, Ctrl+Shift+R to run