Distinct Subsequences
Hard
Dynamic Programming
String DP
Solve Distinct Subsequences.
Input/Output: as specified in examples.
Constraints
Optimized solution required.
Examples
Example 1:
Input: sample
Output:
Example 2:
Input: test
Output:
Hints
Consider a string dp based approach.
Tests:
Runtime:
Memory:
Test
Input:
Expected:
Got:
Click Run Code to test against sample cases, or Submit to test against all cases.
▲ Console