Roadmap DSA Tracker Code Editor Tech Blogs

Loading question...

The ultimate platform to master JavaScript interviews. Comprehensive questions, interactive practice, and detailed explanations.

Explore

Home
Practice Arena
Browse Topics
All Questions

Resources

Learning Roadmap
Cheatsheets
Tech Blog
Community

Stay Updated

Get the latest interview questions and tips delivered to your inbox.

Join 5,000+ developers

© 2026 JS Interview Prep. Made withby developers.

Privacy Terms Cookies

Buy Me A Coffee

Distinct Subsequences

Hard

00:00

0 users online

Given strings s and t, return number of distinct subsequences of s equal to t.

Sample Input:

"rabbbit", "rabbit"

Sample Output:

Hints

Hint 1

Use dynamic programming

Hint 2

DP[i][j] = number of ways to form t[0:j] from s[0:i]

Hint 3

Consider matching and skipping characters

Code Editor

Loading...