How would you write a program to find the shortest pangram in a list of words?
Posted
by jonathanasdf
on Stack Overflow
See other posts from Stack Overflow
or by jonathanasdf
Published on 2010-04-25T19:00:22Z
Indexed on
2010/04/25
19:03 UTC
Read the original article
Hit count: 267
Given a list of words which contains the letters a-z at least once, how would you write a program to find the shortest pangram counted by number of characters (not counting spaces) as a combination of the words?
Since I am not sure whether short answers exist, this is not code golf, but rather just a discussion of how you would approach this. However, if you think you can manage to write a short program that would do this, then go ahead, and this might turn into code golf :)
© Stack Overflow or respective owner