Haskell Quiz/Posix Pangrams
< Haskell Quiz
Jump to navigation
Jump to search
Revision as of 08:39, 27 October 2006 by Jim Burton (talk | contribs)
The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.
RubyQuiz #97: Create pangrams (sentences containing every letter of the alphabet at least once) from the list of [utilities]. From the quiz page: "Pangrams should (1) use the fewest utilities and (2) have the minimum number of repeated letters. In either case, break ties on the other criterion; that is, your first solution should also have as few repeated letters as possible, and your second one should use as few utilities as possible."