# ---
# title: 792. Number of Matching Subsequences
# id: problem792
# author: Tian Jun
# date: 2020-10-31
# difficulty: Medium
# categories: Array
# link: <https://leetcode.com/problems/number-of-matching-subsequences/description/>
# hidden: true
# ---
# 
# Given string `S` and a dictionary of words `words`, find the number of
# `words[i]` that is a subsequence of `S`.
# 
#     
#     
#     **Example :**
#     Input: 
#     S = "abcde"
#     words = ["a", "bb", "acd", "ace"]
#     Output: 3
#     Explanation: There are three words in words that are a subsequence of S: "a", "acd", "ace".
#     
# 
# **Note:**
# 
#   * All words in `words` and `S` will only consists of lowercase letters.
#   * The length of `S` will be in the range of `[1, 50000]`.
#   * The length of `words` will be in the range of `[1, 5000]`.
#   * The length of `words[i]` will be in the range of `[1, 50]`.
# 
# 
## @lc code=start
using LeetCode

## add your code here:
## @lc code=end
