Leetcode Problem 792. Number of Matching Subsequences

792. Number of Matching Subsequences

Leetcode Solutions

Next Letter Pointers

  1. Initialize an array heads with 26 elements, each being an empty list, corresponding to each letter of the alphabet.
  2. Iterate over each word in words and add it to the list in heads corresponding to its first letter.
  3. Initialize a variable matchCount to 0 to keep track of the number of words that are subsequences of s.
  4. Iterate over each letter in s: a. Take the list of words waiting for the current letter. b. For each word in this list, remove the first letter and move the remaining part to the list corresponding to its next waiting letter. c. If a word is empty after removing the first letter, increment matchCount by 1.
  5. Return matchCount.
UML Thumbnail

Brute Force

Ask Question

Programming Language
image/screenshot of info(optional)
Full Screen
Loading...

Suggested Answer

Answer
Full Screen
Copy Answer Code
Loading...