package leetcode;

/**
 * https://leetcode.com/problems/number-of-matching-subsequences/
 */
public class Problem792 {
    public int numMatchingSubseq(String S, String[] words) {
        // TODO
        return 0;
    }

    public static void main(String[] args) {

    }
}

@@ -259,16 +259,164 @@
 args) %7B%0A
+        Problem792 prob = new Problem792();%0A        System.out.println(prob.numMatchingSubseq(%22abcde%22, new String%5B%5D%7B%22a%22, %22bb%22, %22acd%22, %22ace%22%7D)); // 3
 %0A    %7D%0A%7D

Update problem 792