-
Notifications
You must be signed in to change notification settings - Fork 2
spellingbee
bradendubois edited this page Jul 18, 2021
·
7 revisions
ID: spellingbee
Difficulty: 1.9
CPU Time: 3 seconds
Memory: 1024 MB
If one treats each word as a set of letters, then we can check that the word's letters are a subset of the letters given. If this is true, and the length of a word is at least 4, and the first letter appears in the word, print it.