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
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