792. Number of Matching Subsequences

https://leetcode.com/problems/number-of-matching-subsequences/

Number of Matching Subsequences - LeetCode

 

 

from collections import defaultdict

class Solution(object):
    def numMatchingSubseq(self, S, words):
        """
        :type S: str
        :type words: List[str]
        :rtype: int
        """
    
        word_dict = defaultdict(list)
        count = 0
        
        for word in words:
            word_dict[word[0]].append(word)    
            
            
        print(word_dict,"WORD_DICT")
        count = 0
        for char in S:
            
            next_list = word_dict[char]
        
            word_dict[char] = []
            
            for word in next_list:
                
                if len(word) == 1:
                    count += 1
                    
                else:
                    word_dict[word[1]].append(word[1:])
        return count