Skip to main content
Admissions guidance, study banks, and career tools — get started on Shalyam
Shalyam
Sign in Get started

Distinct Subsequences

Hard 2D DP & Knapsack Variants
Log in to solve

Print the number of distinct subsequences of s that equal t.

Constraints

1 <= len(s), len(t) <= 1000

Discussion

No discussions yet.

Rewards · v2.1

Get Exclusive Insights with Every Issue

Join Shalyam Newsletter

Stay ahead in education, research, and innovation—straight to your inbox.