3 ms·
jukebox? jeux is found by my solver, although I'm not sure Sam would include it. I'm working on a site for solving Spelling Bee, Letter Boxed, Strands, etc. Wh
by pvillano 9mo ago
jukebox? jeux is found by my solver, although I'm not sure Sam would include it. I'm working on a site for solving Spelling Bee, Letter Boxed, Strands, etc.
What was your algorithm? Compute a bitset for every word, for each word with 7 unique letters, check against every other word if it has a subset of those letters? Surely there's a better than O(n^2) way
- mbb70 9mo agoStart with your chosen dictionary, remove small words and all 's'es. Then find all words with 7 unique letters, then get the unique set of letter sets. These are your valid puzzles times 7 for each selection of a center letter. Construct a trie of your dictionary. For each letter of each puzzle, walk the trie using only the puzzle letters. When you find a word, if it used the center letter, add to list. In practice it's log(n) for size of dictionary.