DIY: Number of Matching Subsequences

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, ...