DIY: Number of Matching Subsequences

Solve the interview question "Number of Matching Subsequences" in this lesson.

Problem statement

Given a string, S, and an array of words, words, find the number of words[i] that are a subsequence of S.


The input will be a string, S, and a array of strings, words. The following is an example input:

S = "abcde"
words = {"a", "bb", "acd", "ace"}


The output will be the number of subsequences of S that exist in words. For the above input, the output will be:


The words "a", "acd", "ace" are subsequences of S, and their count is 3.

Coding exercise

For this coding exercise, you need to implement the numMatchingSubseq(S, words) function, where S is the string and words is the array of strings. The function should return the number of subsequences of S present in words.

Level up your interview prep. Join Educative to access 70+ hands-on prep courses.