Letter Coverage: Difference between revisions
From charlesreid1
(Created page with "The letter/word coverage problem is the problem of finding the minimum number of words from the five-letter-words set (see Five Letter Words) to cover X letters of the alp...") |
No edit summary |
||
| Line 4: | Line 4: | ||
We may also wish to restrict our search to the first M words of the 5757 total five letter words. | We may also wish to restrict our search to the first M words of the 5757 total five letter words. | ||
[[Category:Dynamic Programming]] | |||
[[Category:Five Letter Words]] | |||
[[Category:AOCP]] | |||
Revision as of 01:23, 16 August 2017
The letter/word coverage problem is the problem of finding the minimum number of words from the five-letter-words set (see Five Letter Words) to cover X letters of the alphabet.
The problem has a couple of variations: we might provide a set of letters, and search for the smallest number of words that can cover those particular letters. Or we might give an integer N <= 26, and search for the smallest number of words that can cover the first N letters of the alphabet.
We may also wish to restrict our search to the first M words of the 5757 total five letter words.