Tap here to switch tabs
Problem
Submissions

Problem: Distinct Subsequences

Distinct Subsequences gives you two strings and asks you to return how many different subsequences of the first match the second string exactly, preserving character order.

Statement

Given two strings, s and t, determine how many distinct subsequences of s match t exactly.

Note: A subsequence is formed by deleting zero or more characters from s without changing the relative order of the remaining characters.

You may assume the result will always fit within a 3232-bit signed integer.

Constraints:

  • 1≤1 \leq s.length, t.length ≤1000\leq 1000

  • s and t consist of English letters.

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Distinct Subsequences

Distinct Subsequences gives you two strings and asks you to return how many different subsequences of the first match the second string exactly, preserving character order.

Statement

Given two strings, s and t, determine how many distinct subsequences of s match t exactly.

Note: A subsequence is formed by deleting zero or more characters from s without changing the relative order of the remaining characters.

You may assume the result will always fit within a 3232-bit signed integer.

Constraints:

  • 1≤1 \leq s.length, t.length ≤1000\leq 1000

  • s and t consist of English letters.