Neetcode
Spaced Repetition
S
ystem
Dashboard
Problems
Drill
Mock
Info
115. Distinct Subsequences
Hard
2-D Dynamic Programming
Open on NeetCode
Open on LeetCode
Watch Video
Optimal Complexity
Time
O(m * n)
Space
O(m * n)
Start First Attempt
Distinct Subsequences — NeetcodeSRS