Package g0701_0800.s0792_number_of_matching_subsequences

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    792 - Number of Matching Subsequences\.

    Medium

    Given a string s and an array of strings words, return the number of words[i] that is a subsequence of s.

    A subsequence of a string is a new string generated from the original string with some characters (can be none) deleted without changing the relative order of the remaining characters.

    • For example, "ace" is a subsequence of "abcde".

    Example 1:

    Input: s = "abcde", words = "a","bb","acd","ace"

    Output: 3

    Explanation: There are three strings in words that are a subsequence of s: "a", "acd", "ace".

    Example 2:

    Input: s = "dsahjpjauf", words = "ahjpjau","ja","ahbwzgqnuk","tnmlanowax"

    Output: 2

    Constraints:

    • <code>1 <= s.length <= 5 * 10<sup>4</sup></code>

    • 1 &lt;= words.length &lt;= 5000

    • 1 &lt;= words[i].length &lt;= 50

    • s and words[i] consist of only lowercase English letters.

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer numMatchingSubseq(String s, Array<String> words)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait