ME

Subsequence Count

Given two strings, find out how many times the first string appears as a subsequence within the second string. A subsequence is formed by removing any number of characters (including zero) from a string without altering the order of the remaining characters.

Example 1:

Input:["HRW","HERHRWS"]

Output:3

Example 2:

Input:["ELO","HELLO WORLD"]

Output:4

Example 3:

Input:["ABC","ABCABC"]

Output:5

Constraints:

length of s1 = 3
1 ≤ length of s2 ≤ 5*10^5
s1 and s2 consist of uppercase English letters, A-Z.

Loading...

Run code to see test results

00:00 / 69:42

Subsequence Count

MediumMed•117 views

Given two strings, find out how many times the first string appears as a subsequence within the second string. A subsequence is formed by removing any number of characters (including zero) from a string without altering the order of the remaining characters.