DIY: Number of Matching Subsequences
We'll cover the following
Problem statement
Given a string, S, and a list of words, words, find the number of words[i] that are a subsequence of S.
Input
The input will be a string, S, ...
Create a free account to view this lesson.
Continue your learning journey with a 14-day free trial.
By signing up, you agree to Devpath's Terms of Service and Privacy Policy