Subsets & Combinations - Number of Valid Words for Each Puzzle
Given the following partial frequency map from words: {0b10101: 2, 0b10010: 1} and puzzle "abcde" (letters a,b,c,d,e), which word mask corresponds to a valid word counted for this puzzle if the puzzle's first letter is 'a' (bit 0)?
