Subsets & Combinations - Number of Valid Words for Each Puzzle
Given the following code snippet using bitmask + hash map frequency counting, what is the output for words = ["apple", "plea", "plea"] and puzzles = ["aelwxyz"]?
```python
def findNumOfValidWords(words, puzzles):
freq = {}
for word in words:
mask = 0
for ch in set(word):
mask |= 1 << (ord(ch) - ord('a'))
if bin(mask).count('1') <= 7:
freq[mask] = freq.get(mask, 0) + 1
res = []
for puzzle in puzzles:
first = 1 << (ord(puzzle[0]) - ord('a'))
count = 0
# Enumerate subsets of puzzle letters excluding first
def backtrack(i, mask):
nonlocal count
if i == len(puzzle):
if mask in freq and (mask & first):
count += freq[mask]
return
backtrack(i + 1, mask)
backtrack(i + 1, mask | (1 << (ord(puzzle[i]) - ord('a'))))
backtrack(1, first)
res.append(count)
return res
print(findNumOfValidWords(["apple", "plea", "plea"], ["aelwxyz"]))
```