Leetcode 115. Distinct Subsequences

Count the number of distinct subsequences of s that equal t — i.e., the number of ways to delete characters from s (keeping relative order) to form t. With |s|,|t| ≤ 1000 and the answer fitting in a 32-bit integer, this is the classic DP counting problem.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 115. Distinct Subsequences

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact